A memory-efficient optimal APP symbol-elecoding algorithm for linear block codes

Trofimov, A
Johansson, Thomas

Open link

Publication date

January 2004

DOI

10.1109/TCOMM.2004.833067

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Abstract

We propose a simple modification of the famous Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm for linear block codes. The modified algorithm requires one forward and two backward recursions in the code trellis, but eliminates the need to store the whole trellis. Compared with the BCJR algorithm, the computational complexity is slightly increased, but the storage requirement is reduced

Extracted data

We use cookies to provide a better user experience.

Data Protection

A memory-efficient optimal APP symbol-elecoding algorithm for linear block codes

Abstract

Extracted data

A memory-efficient optimal APP symbol-elecoding algorithm for linear block codes

Abstract

Extracted data

Related items

Related items