Low Complexity, High Performance LDPC Codes Based on Defected Fullerene Graphs

Authors: Ashish Goswami, Rakesh Sharma

Abstract:

In this paper, LDPC Codes based on defected fullerene graphs have been generated. And it is found that the codes generated are fast in encoding and better in terms of error performance on AWGN Channel.

Keywords: LDPC Codes, Fullerene Graphs, Defected Fullerene Graphs.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1078895

References:

[1] R. G. Gallager, Low-Density Parity-Check Codes, IRE Trans. Information Theory, vol. 8, no. 1, pp. 21-28, January 1962.
[2] Hongwei Song, Jingfeng Liu, B.V.K.V. Kumar, Low Complexity LDPC Codes for Partial Response Channels, IEEE Globecom 2002, vol. 2, pp. 1294-1299, November 2002.
[3] Gabofetswe Malema and Michael Liebelt, High Girth Column-Weight- Two LDPC Codes Based on Distance Graphs, EURASIP Journal on Wireless Communications and Networking Volume 2007, Article ID 48158, 5 pages.
[4] G. Malema, and M. Liebelt, Low Complexity Regular LDPC codes for Magnetic Storage Devices, Proc. of World Academy of Science, Engineering and Technology, Issue 7, 2005.
[5] Rashid Zaare-Nahandi, Some Infinite Classes of Fullerene Graphs, International Mathematical Forum, 1, 2006, no. 40, 1997-2002.
[6] T. J. Richardson and R. L. Urbanke, Efficient Encoding of Low-Density Parity-Check Codes, IEEE Trans. on Information Theory, vol. 47, no. 2, pp. 638-656, February 2001
[7] C Prasartkaew, S Choomchuay, A design of parity check matrix for Irregular LDPC codes, IEEE 9th International Symposium on Communications and Information Technology, ISCIT 2009, pp. 239- 242, 2009.
[8] D. J. C. MacKay and R. M. Neal, Near Shannon Limit Perfoemance of Low Density Parity Check Codes, IEEE Electronics Letters Vol. 32 No. 18, pp. 1645-1646, 29th August 1996.