Share This Article:

Serial Genetic Algorithm Decoder for Low Density Parity Check Codes

Abstract Full-Text HTML XML Download Download as PDF (Size:477KB) PP. 358-366
DOI: 10.4236/ijcns.2015.89034    1,459 Downloads   1,860 Views  
Author(s)    Leave a comment


Genetic algorithms are successfully used for decoding some classes of error correcting codes, and offer very good performances for solving large optimization problems. This article proposes a new decoder based on Serial Genetic Algorithm Decoder (SGAD) for decoding Low Density Parity Check (LDPC) codes. The results show that the proposed algorithm gives large gains over sum-product decoder, which proves its efficiency.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

Chaibi, H. (2015) Serial Genetic Algorithm Decoder for Low Density Parity Check Codes. International Journal of Communications, Network and System Sciences, 8, 358-366. doi: 10.4236/ijcns.2015.89034.


[1] Maini, H.S., Mehrotra, K.G., Mohan, C. and Ranka, S. (1994) Genetic Algorithms for Soft Decision Decoding of Linear Block Codes. Journal of Evolutionary Computation, 2, 145-164.
[2] Han, Y.S., Hartmann, C.R.P. and Chen, C.-C. (1991) Efficient Maximum Likelihood Soft Decision Decoding of Linear Block Codes Using Algorithm A*. Technical Report SUCIS-91-42, School of Com-puter and Information Science, Syracuse University, Syracuse, NY 13244.
[3] Azouaoui, A., Belkasmi, M. and Farchane, A. (2012) Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms. Journal of Electrical and Computer Engineering, 2012, Article ID 503834, 12 p.
[4] Wu, J.-L., Tseng, Y.-H. and Huang, Y.-M. (2002) Neural Networks Decoders for Linear Block Codes. International Journal of Computational Engineering Science, 3, 235-255.
[5] Gallager, R.G. (1963) Low-Density Parity-Check Codes. The MIT Press, Cambridge.
[6] Khalifa, O.O., Khan, S., Zaid, M. and Nawawi, M. (2008) Performance Evaluation of Low Density Parity Check Codes. International Journal of Computer Science and Engineering, 2, 67-70.
[7] Richardson, T., Shokrollahi, A. and Urbanke, R. (2001) Design of Capacity Approaching Irregular Low-Density Parity-Check Codes. IEEE Transactions on Information Theory, 47, 619-637.
[8] Richardson, T. and Urbanke, R. (2001) The Capacity of Low-Density Parity-Check Codes under Message-Passing Decoding. IEEE Transactions on Information Theory, 47, 599-618.
[9] MacKay, D.J.C. (1999) Good Error-Correcting Codes Based on Very Sparse Matrices. IEEE Transactions on Information Theory, 45, 399-431.
[10] MacKay, D.J.C. and Neal, R.M. (1997) Near Shannon Limit Performance of Low-Density Parity-Check Codes. Electronics Letters, 33, 457-458.
[11] Gordon, V.S. and Whitley, D. (1993) Serial and Parallel Genetic Algorithms as Function Optimizers. In: Forrest, S., Ed., Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo, 177-183.
[12] Janikow, C.Z. and Michalewicz, Z. (1991) An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms. Proc. 4th Int. Conf. Genetic Algorithms, July 1991, 31-36.
[13] Holland, J. (1975) Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor.
[14] Kaya, Y., Uyar, M. and Tekin, R. (2011) A Novel Crossover Operator for Genetic Algorithms: Ring Crossover. Presented at CoRR.

comments powered by Disqus

Copyright © 2019 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.