Abstract
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.
Highlights
The current large development and deployment of wireless and digital communication encourage the research activities in the domain of error correcting codes
In this article we introduce a new Serial Genetic Algorithm Decoder (SGAD) Low Density Parity Check (LDPC) codes
We have proposed a new decoder based on serial GA for LDPC codes
Summary
The current large development and deployment of wireless and digital communication encourage the research activities in the domain of error correcting codes. The latter is used to improve the reliability of data transmitted over communication channels susceptible to noise. Hard decision algorithms work on a binary form of the received information. Soft decision algorithms work directly on the received symbols [1]. Soft-decision decoding is a NP-hard problem and has been approached in different ways. The decoding of linear block codes uses algorithm A* [2], genetic algorithms [1] [3] and neural networks [4].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Communications, Network and System Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
