Near optimal reduced-complexity decoding algorithms for LDPC codes

In this paper, two families of reduced-complexity algorithms for decoding low-density parity-check (LDPC) codes based on incorporating either a normalization or a correction term in the check-node update are presented. A simplified symbol-node update can also be used. Using simulations, it is shown that these simplified belief propagation (BP) approaches provide near optimum performance with different classes of LDPC codes.

[1]  Jinghu Chen,et al.  Near optimum universal belief propagation based decoding of low-density parity check codes , 2002, IEEE Trans. Commun..

[2]  Jinghu Chen,et al.  Decoding low-density parity check codes with normalized APP-based algorithm , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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