Adaptive normalized min-sum algorithm for LDPC decoding

This paper proposes an adaptive normalized min-sum algorithm for the decoding of low-density parity check (LDPC) codes, which utilizes an adaptive normalization factor to improve the accuracy of the soft information transferred during the iterative decoding process, and provides superior performance accordingly. This adaptive normalization factor can be adjusted dynamically and adaptively at each decoding iteration according to a look-up table obtained via training and simulation. Its implementation facility and independence from the channel characteristics make the proposed adaptive normalized min-sum algorithm expect a wide application. Simulation results show that the proposed algorithm can achieve performance much closer to the sum-product algorithm and a coding gain of around 0.2dB compared to the conventional normalized min-sum algorithm for DVB-S2's rate 2/5 and 3/5 LDPC codes over the additive white Gaussian noise (AWGN) channel.

[1]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.

[2]  T. Richardson,et al.  Multi-Edge Type LDPC Codes , 2004 .

[3]  F.M.J. Willems,et al.  Elements of Information Theory [Book Review] , 1993, IEEE Transactions on Information Theory.

[4]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[5]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

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

[7]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[8]  大西 仁,et al.  Pearl, J. (1988, second printing 1991). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan-Kaufmann. , 1994 .

[9]  Gottfried Lechner,et al.  Improved Sum-Min Decoding for Irregular LDPC Codes , 2006 .

[10]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

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

[12]  Gottfried LECHNER Improved Sum-Min Decoding of LDPC Codes , .

[13]  Wenjun Zhang,et al.  Variable Min-Sum decoding based on generalized mutual information metric , 2014, 2014 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting.

[14]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[15]  Bo Rong,et al.  Variable LLR Scaling in Min-Sum Decoding for Irregular LDPC Codes , 2014, IEEE Transactions on Broadcasting.

[16]  Hyuncheol Park,et al.  Modified UMP-BP decoding algorithm based on mean square error , 2004 .

[17]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

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

[19]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.