Simplified sum-product algorithm for decoding LDPC codes with optimal performance

A simple, yet effective decoding algorithm is proposed for low-density parity-check (LDPC) codes, which significantly simplifies the check node update computation of the optimal sum-product algorithm. It achieves essentially optimal performance by applying scaling in the decoder's extrinsic information. If no such scaling is applied, then the proposed algorithm has small performance degradation, e.g. in the order of 0.1 to 0.2 dB, depending on the coded block size.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[3]  Ajay Dholakia,et al.  Reduced-complexity decoding of LDPC codes , 2005, IEEE Transactions on Communications.

[4]  Ajay Dholakia,et al.  Efficient implementations of the sum-product algorithm for decoding LDPC codes , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[5]  Bahram Honary,et al.  Low-complexity decoding of LDPC codes , 2007 .

[6]  Xian-Da Zhang,et al.  Reduced-complexity belief propagation decoding for low-density parity-check codes , 2008 .

[7]  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.

[8]  B. Shahrrava,et al.  An Improved Max-Log-MAP Algorithm for Turbo Decoding and Turbo Equalization , 2007, IEEE Transactions on Instrumentation and Measurement.