Abstract
A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA). The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase‐2 decoding algorithm and reach the performance of the OSD‐3 for some quadratic residue (QR) codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms.
Highlights
The current large development and deployment of wireless and digital communication encourage the research activities in the domain of error correcting codes
Cardoso and Arantes [5] came to work on the hard decoding of linear block codes using GA and Shakeel [6] worked on soft-decision decoding for block codes using a compact genetic algorithm
In order to show the effectiveness of Decoding GA algorithm (DDGA), we do intensive simulations
Summary
The current large development and deployment of wireless and digital communication encourage the research activities in the domain of error correcting codes. Cardoso and Arantes [5] came to work on the hard decoding of linear block codes using GA and Shakeel [6] worked on soft-decision decoding for block codes using a compact genetic algorithm These decoders based on GA use the generator matrix of the code; this fact makes the decoding very complicated for codes of high rates. A comparison with other decoders, that are currently the most successful algorithms for soft decision decoding, shows its efficiency This new decoder can be applied to any binary linear block code, for codes without algebraic. Unlike chase algorithm which needs an algebraic hard-decision decoder It uses the dual code and works with parity-check matrix.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
