Soft-Output BEAST Decoding With Application to Product Codes

A bidirectional efficient algorithm for searching code trees (BEAST) is proposed for efficient soft-output decoding of block codes and concatenated block codes. BEAST operates on trees corresponding to the minimal trellis of a block code and finds a list of the most probable codewords. The complexity of the BEAST search is significantly lower than the complexity of trellis-based algorithms, such as the Viterbi algorithm and its list generalizations. The outputs of BEAST, a list of best codewords and their metrics, are used to obtain approximate a posteriori probabilities (APPs) of the transmitted symbols, yielding a soft-input soft-output (SISO) symbol decoder referred to as the BEAST-APP decoder. This decoder is employed as a component decoder in iterative schemes for decoding of product and incomplete product codes. Its performance and convergence behavior are investigated using extrinsic information transfer (EXIT) charts and compared to existing decoding schemes. It is shown that the BEAST-APP decoder achieves performances close to the Bahl-Cocke-Jelinek-Raviv (BCJR) decoder with a substantially lower computational complexity.

[1]  Rolf Johannesson,et al.  BEAST decoding for block codes , 2004, Eur. Trans. Telecommun..

[2]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[3]  Rolf Johannesson,et al.  Estimating the list size for BEAST-APP decoding , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[4]  Sergio Benedetto,et al.  Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.

[5]  Rolf Johannesson,et al.  A BEAST for prowling in trees , 2004, IEEE Transactions on Information Theory.

[6]  Peter Adam Hoeher,et al.  Separable MAP "filters" for the decoding of product and concatenated codes , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[7]  Shigeichi Hirasawa,et al.  An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder , 1994, IEEE Trans. Inf. Theory.

[8]  Shu Lin,et al.  Soft-decision decoding of linear block codes based on ordered statistics , 1994, IEEE Trans. Inf. Theory.

[9]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[10]  Frank R. Kschischang,et al.  On the trellis structure of block codes , 1994, IEEE Trans. Inf. Theory.

[11]  Antoine Berthet,et al.  A comparison of SISO algorithms for iterative decoding of multidimensional product codes , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[12]  Desmond P. Taylor,et al.  Soft-input soft-output list-based decoding algorithm , 2004, IEEE Transactions on Communications.

[13]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[14]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[15]  Dariush Divsalar,et al.  Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding , 1997, IEEE Trans. Inf. Theory.

[16]  Steven W. McLaughlin,et al.  An efficient Chase decoder for turbo product codes , 2004, IEEE Transactions on Communications.

[17]  Ramesh Pyndiah,et al.  Near-optimum decoding of product codes: block turbo codes , 1998, IEEE Trans. Commun..

[18]  Lajos Hanzo,et al.  Modified MAP Algorithm for Extended Turbo BCH Codes and Turbo Equalisers , 2000 .

[19]  L. Goddard.  Information Theory , 1962, Nature.

[20]  Gottfried LECHNER.  Improved Sum-Min Decoding of LDPC Codes , .

[21]  Rolf Johannesson,et al.  On APP-decoding using BEAST , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[22]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[23]  Carl-Erik W. Sundberg,et al.  List Viterbi decoding algorithms with applications , 1994, IEEE Trans. Commun..

[24]  Robert J. McEliece,et al.  On the BCJR trellis for linear block codes , 1996, IEEE Trans. Inf. Theory.

[25]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[26]  Rolf Johannesson,et al.  BEAST decoding of block codes obtained via convolutional codes , 2005, IEEE Transactions on Information Theory.

[27]  Maja Loncar,et al.  Taming of the BEAST , 2007 .

[28]  Jack K. Wolf,et al.  Efficient maximum likelihood decoding of linear block codes using a trellis , 1978, IEEE Trans. Inf. Theory.

[29]  Takeshi Hashimoto.  A list-type reduced-constraint generalization of the Viterbi algorithm , 1987, IEEE Trans. Inf. Theory.

[30]  Rolf Johannesson,et al.  Trellis Complexity of Short Linear Codes , 2007, IEEE Transactions on Information Theory.

[31]  S. Brink.  Convergence of iterative decoding , 1999 .

[32]  Yair Be'ery,et al.  Convergence Analysis of Turbo Decoding of Serially Concatenated Block Codes and Product Codes , 2005, EURASIP J. Adv. Signal Process..

[33]  Bernard Mulgrew,et al.  Improved Max-Log-MAP Turbo Decoding by Maximization of Mutual Information Transfer , 2005, EURASIP J. Adv. Signal Process..

[34]  Ieee Microwave Theory,et al.  IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems Draft Amendment: Management Information Base Extensions , 2007 .