LDPC Codes with the Layered LLR-BP Algorithm for 3GPP

Abstract:

We propose a layered log-likelihood-ratio-based belief propagation(LLR-BP)algorithm for Low Density Parity Check (LDPC)codes. In the conventional decoding algorithm, the process of decoding would be terminated when it reaches the maximum iterative number or the near-convergence is achieved. The proposed algorithm is based on the variable node information quantification and stop updating criterion thought. By dividing the absolute value of the variable node to different layers, a part of the check nodes stop the iteration before reaching the maximum iterative number to save iterative time. From the simulation results, we know that the improved decoding algorithm successively achieves lower computation complexity than the conventional one .And the layered LLR-BP algorithm is a better scheme for LDPC codes.

• Periodical: Applied Mechanics and Materials (Volumes 462-463)
• Pages: 720-723
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.462-463.720
• Online since: November 2013
• Authors: Miao Miao Li, Jian Ping Li, Chao Shi Cai
• Keywords: Iterative Decoding, Layer LLR-Bp Algorithm, LDPC, LLR-BP Algorithm

References

[1] R.G. Gallager, Low-density parity check codes, IRE Transaction Info. Theory, vol. IT-8, p.21–28, Jan. (1962).

[2] Tanner, R. M, A recursive approach to low complexity codes, IEEE Trans. Inf. Theory, 1981, 27, (5), p.533– 547.

DOI: 10.1109/tit.1981.1056404

[3] D. MacKay, Good error-correcting codes based on very sparse matrices, IEEE Trans. Information Theory, vol. 45, no. 2, p.399–431, (1999).

DOI: 10.1109/18.748992

[4] S. Y. Chung, G. D. Forney, Jr., T. J. Richardson, and R. Urbanke, On the design of low-density parity-check codes within 0. 0045 dB of the Shannon limit, IEEE Commun. Lett., vol. 5, pp.58-60, Feb. (2001).

DOI: 10.1109/4234.905935

[5] J. Chen, A. Dholakia, E. Eleftheriou, M.P.C. Fossorier, Reduced complexity decoding of LDPC codes, IEEE Trans. Commun. USA, vol. 53, no. 8, pp.1288-1299, Aug. (2005).

DOI: 10.1109/tcomm.2005.852852

[6] J. Li, X. H. You, and J. Li, Early stopping for LDPC decoding: Convergence of mean magnitude (CMM), IEEE Comm. Lett., vol. 10, no. 9, p.667–669, Sep. (2006).

DOI: 10.1109/lcomm.2006.1714539

[7] X. Chen, A. Men, and W. Zhou, A stopping criterion for nonbinary LDPC codes over GF(q), in Proc. 11th IEEE Singapore Int. Conf. Communication Systems (ICCS), Guangzhou, China, 2008, p.1312–1315.

DOI: 10.1109/iccs.2008.4737395

[8] G. Han and X. Liu, A unified early stopping criterion for binary and nonbinary LDPC codes based on check-sum variation patterns, IEEE Commun. Lett., vol. 14, no. 11, p.1053–1055, Nov. (2010).

DOI: 10.1109/lcomm.2010.100410.100998