A memory-efficient optimal APP symbol-elecoding algorithm for linear block codes
Författare
Summary, in English
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.
Publiceringsår
2004
Språk
Engelska
Sidor
1429-1434
Publikation/Tidskrift/Serie
IEEE Transactions on Communications
Volym
52
Issue
9
Dokumenttyp
Artikel i tidskrift
Förlag
IEEE - Institute of Electrical and Electronics Engineers Inc.
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Nyckelord
- A posteriori probability (APP) decoding
- linear block codes
- trellis
Status
Published
ISBN/ISSN/Övrigt
- ISSN: 0090-6778