A Kind of Improved PEG Algorithm of Q-Ary LDPC Codes

Abstract:

Progressive-edge-growth (PEG) algorithm is one of the best known methods for constructing LDPC codes at short and intermediate block lengths, however, the codes directly designed by such algorithm has high encoding complexity, especially for q-ary LDPC codes, encoding complexity increases with the increase of q value rapidly, which hinder the development of q-ary LDPC code’s implementation seriously. To such problem, the paper presents a improved method based on PEG algorithm which can be encoded by the iterative encoding algorithm with the liner operation complexity. The simulation results indicate: Though the error correcting capability of irregular q-ary LDPC codes constructed by the proposed methods in the paper is basically identical with the codes constructed by the PEG algorithm, but the powerful advantage makes it be easily implemented by the hardware .

• Periodical: Applied Mechanics and Materials (Volumes 130-134)
• Pages: 3032-3035
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.130-134.3032
• Online since: October 2011
• Authors: Ning Ning Tong, Dan Feng Zhao, Yu Ping Wu
• Keywords: Iterative Encoding, Lower Triangular Form, PEG Algorithm, Q-Ary LDPC Codes

References

[1] Matthew C. Davey and David J. C. Mackay, Low Density Parity Check Codes over GF(q), ITW, Killarney, Ireland, June. 1998: 70-71.

DOI: 10.1109/itw.1998.706440

[2] D.J.C. MacKay and M. Davey, Evaluation of Gallager Codes for Short Block Length and High Rate Applications, in the proc. of IMA Workshop on Codes, Systems and Graphical Models, (1999).

DOI: 10.1007/978-1-4613-0165-3_6

[3] X. -Y. Hu and E. Eleftheriou, Binary Representation of Cycle Tanner-Graph GF(2q) Codes, The Proc. IEEE Intern. Conf. on Commun. Paris, France, June 2004 : 528-532.

DOI: 10.1109/icc.2004.1312545

[4] A. Bennatan and David Burshtein, Design and Analysis of Non binary LDPC Codes for Arbitrary Discrete-Memoryless Channels, IEEE Trans. on Inform. Theory, Vol. 52, No. 2, Feb. 2006 : 549-583.

DOI: 10.1109/tit.2005.862080

[5] A. Bennatan and D. Burshtein, On the application of LDPC Codes to arbitrary discrete-memoryless channels, IEEE Trans. on Inform. . Theory, Vol 50, Mar. 2004 : 417一438.

DOI: 10.1109/tit.2004.824917

[6] Ge Li, Ivan J. Fair and Witold A. Krzymien, Low-density Parity-Check Codes for Space-Time Wireless Transmission, IEEE Transactions on Wireless Communications, Vol. 5, No. 2, February 2006: 312-322.

DOI: 10.1109/twc.2006.1611055

[7] Guo, F: Hanzo, Low Complexity Non-binary LDPC and Modulation Schemes Communicating over MIMO channel, IEEE Vehicular Technology Conference, vol.

DOI: 10.1109/vetecf.2004.1400232

[8] T.J. Richardson and R. L. Urbanke. Efficient Encoding of Low-Density Parity-Check Codes", IEEE Transactions on Information Theory, Vol 47, No. 2, Feb. (2001).

DOI: 10.1109/18.910579

[9] M.P.C. Fossorier, Quasi-cyclic low-density parity-check codes from circulant permutation matrices, IEEE Trans. Inform. Theory, vol. 50, pp.1788-1793, Aug. (2004).

DOI: 10.1109/tit.2004.831841

[10] Peng Wang, Xinmei Wang. Study of efficient encoding of LDPC codes. Journal of Xidian university. pp.934-938. 2004. 6.