Simplified forced convergence decoding algorithm for low power LDPC decoders

This paper proposes a simplified forced-convergence (SFC) algorithm to reduce the computational complexity for low-density parity-check (LDPC) decoding. To reduce the computational complexity, the proposed algorithm uses the modified check node (CN) operation that does not use a condition for deactivating CNs. Therefore, the proposed SFC algorithm uses only one threshold value while the existing forced-convergence (FC) algorithm uses two threshold values. The simulation results show that SFC achieves a bit error rate (BER) performance close to min-sum (MS) algorithm. SFC can reduce the computational complexity of check node by approximately 22.21% compared to FC.

[1]  Chia-Yu Lin,et al.  Switching activity reducing layered decoding algorithm for LDPC codes , 2008, 2008 IEEE International Symposium on Circuits and Systems.

[2]  Simon Litsyn,et al.  Lazy scheduling forLDPC decoding , 2007, IEEE Communications Letters.

[3]  Gerhard Fettweis,et al.  Reduced Complexity LDPC Decoding using Forced Convergence , 2004 .

[4]  Wolfgang Rave,et al.  Forced Convergence Decoding of LDPC Codes - EXIT Chart Analysis and Combination with Node Complexity Reduction Techniques , 2005 .

[5]  Hongwen Yang,et al.  A new forced convergence decoding scheme for LDPC codes , 2009, 2009 IEEE International Conference on Communications Technology and Applications.

[6]  N. Varnica,et al.  Iteratively decodable codes for bridging the shaping gap in communication channels , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[7]  R. Aoyama,et al.  Improvement of the forced-convergence decoding for LDPC codes , 2008, 2008 International Symposium on Information Theory and Its Applications.

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

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

[10]  Hideki Imai,et al.  Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..