Modified min-sum decoding algorithm for LDPC codes based on classified correction

In this paper, a modified min-sum decoding algorithm based on classified correction is proposed for low density parity check (LDPC) codes. Different from the single correction in the normalized belief propagation (BP)-based and offset BP-based algorithms [4], the proposed algorithm utilizes two corrections for both minimum and sub-minimum magnitudes of input messages in check nodes. These two correction factors can be obtained by analyzing the offset of updated messages in check nodes between the BP and the min-sum algorithms associated with check node degree. Simulation results show that the proposed algorithm can achieve performance very close to that of the BP algorithm. Furthermore, the FPGA implementation of this algorithm can reach a throughput of 200 Mbps at BER=10-6 with lower complexity and fewer resources than the BP algorithm.

[1]  Zongwang Li,et al.  Efficient encoding of quasi-cyclic low-density parity-check codes , 2006, IEEE Trans. Commun..

[2]  Zhongfeng Wang,et al.  Low-Complexity High-Speed Decoder Design for Quasi-Cyclic LDPC Codes , 2007, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

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

[4]  Vincent C. Gaudet,et al.  Degree-Matched Check Node Decoding for Regular and Irregular LDPCs , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.

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

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

[7]  Keshab K. Parhi,et al.  A 54 Mbps (3,6)-regular FPGA LDPC decoder , 2002, IEEE Workshop on Signal Processing Systems.

[8]  Jinghu Chen,et al.  Density evolution for two improved BP-Based decoding algorithms of LDPC codes , 2002, IEEE Communications Letters.

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

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

[11]  Shu Lin,et al.  Near Shannon limit quasi-cyclic low-density parity-check codes , 2004, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).