Algorithm using Stopping Node for LDPC Decoding

Low-Density-Parity -Check Code (LDPC) codes have received great attention recently because of the excellent error­ correcting capability and optional error correct code. A new method base on Min-Sum-Plus-Cor rection-Factor Algorithm using stopping node to reduce computing complexity on Low-Density-Parity -Check Code decoding algorithm is presented in this paper. The improved method shows how to make early decisions to reduce computation complexity of LDPC decoding algorithm in the next iteration under QPSK systems. Simulation results show that computational complexity of LDPC decoding using Stopping node criterion can reduce up to 6 times with maintaining quality level. Keywords-Low-density-Parity -check Codes, Min-Sum Algorithm, Stopping node, Iterative decoding, Min-Sum-Plus­ Correction-Facto r Algorithm

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

[2]  Shu Lin,et al.  Two simple stopping criteria for turbo decoding , 1999, IEEE Trans. Commun..

[3]  Myung Hoon Sunwoo,et al.  New simplified sum-product algorithm for low complexity LDPC decoding , 2008, 2008 IEEE Workshop on Signal Processing Systems.

[4]  Hendrawan,et al.  Comparison of decoding algorithms for LDPC codes of IEEE 802.16e standard , 2011, 2011 6th International Conference on Telecommunication Systems, Services, and Applications (TSSA).

[5]  Hanhong Jiang,et al.  Design of a New Kind of LDPC Decoder , 2009, 2009 2nd International Congress on Image and Signal Processing.

[6]  William P. Marnane,et al.  Efficient low-density parity-check decoding , 2004 .