Turbo decoding of product codes using adaptive belief propagation

• Published in: IEEE transactions on communications Vol. 57; no. 10; pp. 2864 - 2867
• Main Authors: Jego, C., Gross, W.J.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.10.2009; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Adaptive algorithms; adaptive belief propagation; Algorithms; Applied sciences; BCH codes; Belief propagation; Block codes; Coding, codes; Complexity; Computer simulation; Decoding; Exact sciences and technology; Information, signal and communications theory; Iterative algorithms; Iterative decoding; Mathematical analysis; Matrices; Message passing; Parity check codes; Product codes; Reed-Solomon codes; Signal and communications theory; Sparse matrices; Telecommunications; Telecommunications and information theory; Tradeoffs; Reed Solomon code; Performance evaluation; Product codes; adaptive belief propagation; Iterative method; Turbo code; Algorithm; Iterative decoding; Reed-Solomon codes; Credal approach; Simulation; BCH code; BCH codes; Parity check; Product code; Adaptive belief propagation; Reed-Solomon code
• ISSN: 0090-6778; 1558-0857
• DOI: 10.1109/TCOMM.2009.10.070277

The adaptive belief propagation (ABP) algorithm was recently proposed by Jiang and Narayanan for the soft decoding of Reed-Solomon (RS) codes. In this paper, simplified versions of this algorithm are investigated for the turbo decoding of product codes. The complexity of the turbo-oriented adaptive belief propagation (TAB) algorithm is significantly reduced by moving the matrix adaptation step outside of the belief propagation iteration loop. A reduced-complexity version of the TAB algorithm that offers a trade-off between performance and complexity is also proposed. Simulation results for the turbo decoding of product codes show that belief propagation based on adaptive parity check matrices is a practical alternative to the currently very popular Chase-Pyndiah algorithm.