Title :
A memory-efficient optimal APP symbol-decoding algorithm for linear block codes
Author :
Trofimov, A. ; Johansson, T.
Author_Institution :
Dept. of Inf. Syst., St. Petersburg State Univ. of Aerosp. Instrum., Russia
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.
Keywords :
block codes; computational complexity; decoding; linear codes; probability; trellis codes; Bahl-Cocke-Jelinek-Raviv algorithm; a posteriori probability; backward recursion; code trellis; computational complexity; forward recursion; linear block codes; memory-efficient optimal APP symbol-decoding algorithm; Aerospace electronics; Block codes; Communications Society; Computational complexity; Convolutional codes; Information systems; Information technology; Iterative algorithms; Iterative decoding; Viterbi algorithm; A posteriori probability; APP; decoding; linear block codes; trellis;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOMM.2004.833067
