A memory-efficient optimal APP symbol-elecoding algorithm for linear block codes
Author
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.
Publishing year
2004
Language
English
Pages
1429-1434
Publication/Series
IEEE Transactions on Communications
Volume
52
Issue
9
Document type
Journal article
Publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Keywords
- A posteriori probability (APP) decoding
- linear block codes
- trellis
Status
Published
ISBN/ISSN/Other
- ISSN: 0090-6778