A Novel Construction Method of QC-LDPC Codes Based on Generalized ACE Constrained

Abstract:

Recently, structured LDPC codes have been focused on due to excellent performance and lower complexity. An improved construction of QC-LDPC based on a modified PEG algorithm is proposed in this paper. The modified Progressive Edge-Growth algorithm is a PEG algorithm with Approximated Cycle Extrinsic Message Degree (ACE) metric, which is used to describe the connectivity of cycles. The approach can maximize the girth of the cycles, improve the connectivity of cycles and have the advantages of QC algorithms. The simulation results demonstrate that the PEG algorithm based on ACE has lower Bit Error Rate (BER) and Frame Error Rate (FER) than the original PEG algorithm at the low Signal Noise Ratio (SNR) values, and has a relatively lower computational complexity.

• Periodical: Advanced Materials Research (Volumes 760-762)
• Pages: 1684-1689
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.760-762.1684
• Online since: September 2013
• Authors: Hong Hao Zhao, Fan Bo Meng, Qing Qi Zhao, Jie Wang
• Keywords: Approximated Cycle Extrinsic Message Degree (ACE), Low-Density Parity-Check (LDPC), Progressive Edge-Growth Algorithm (PEG)

References

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

DOI: 10.1109/tit.1962.1057683

[2] D. J. C. MacKay and R. M. Neal. Near shannon limit performance of low-density parity-check codes, Electron. Lett., vol. 32, p.1645–1646, Aug. (1996).

DOI: 10.1049/el:19961141

[3] T. J. Richardson and R. L. Urbanke, Design of capacity-approaching irregular low-density parity-check codes, IEEE Trans. Inf. Theory, vol. 47, p.619–637, Feb. (2001).

DOI: 10.1109/18.910578

[4] X. Y. Hu, E. Eleftheriou, and D. M. Arnold. Regular and irregular progressive edge-growth tanner graphs, IEEE Trans. Inf. Theory, vol. 51, pp: 386–398, Jan. (2005).

DOI: 10.1109/tit.2004.839541

[5] T. Tian, C. R. Jones, J. D. Villasenor, and R. D. Wesel, Selective avoidance of cycles in irregular LDPC code construction, IEEE Trans. Commun., vol. 50, p.1242–1247, Aug. (2004).

DOI: 10.1109/tcomm.2004.833048

[6] T. Tian, C. R. Jones, J. D. Villasenor, and R. D. Wesel, Construction of irregular LDPC codes with low error floors, IEEE Conference on Communications (ICC, 03), IEEE Press, May 2003, p.3125–3129.

DOI: 10.1109/icc.2003.1203996

[7] D. Vukobratovic, A. Djurendic, and V. Senk, ACE spectrum of LDPC codes and generalized ACE design, in Proc. IEEE Conference on Communications (ICC, 07), IEEE Press, Jun. 2007, p.665–670.

DOI: 10.1109/icc.2007.114

[8] D. Vukobratovic, and V. Senk, Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design, IEEE Commun. Lett., vol. 12, p.32–34, Jan. (2008).

DOI: 10.1109/lcomm.2008.071457

[9] D. Vukobratovic, and V. Senk, Evaluation and Design of irregular LDPC Codes Using ACE Spectrum, IEEE Trans. Commun. vol. 57, pp.2272-2279, Aug. (2009).

DOI: 10.1109/tcomm.2009.08.070548

[10] J. Li, N. Di and M. Yang, Construction of Quasi Cyclic LDPC with ACE constraint, IEEE International Conference on Wireless Communications, Networking and Information Security (ECNIS, 10), IEEE Press, Aug. 2010, p.90–93.

DOI: 10.1109/wcins.2010.5541895