Genetic algorithms for soft-decision decoding of linear block codes

Authors:
Harpal Maini;Kishan Mehrotra;Chilukuri Mohan;Sanjay Ranka
Affiliations:
School of Computer and Information Science 4-116 Center for Science and Technology Syracuse University Syracuse, NY 13244-4100 hsmaini@top.cis.syr.edu;School of Computer and Information Science 4-116 Center for Science and Technology Syracuse University Syracuse, NY 13244-4100 kishan@top.cis.syr.edu;School of Computer and Information Science 4-116 Center for Science and Technology Syracuse University Syracuse, NY 13244-4100 mohan@top.cis.syr.edu;School of Computer and Information Science 4-116 Center for Science and Technology Syracuse University Syracuse, NY 13244-4100 ranka@top.cis.syr.edu
Venue:
Evolutionary Computation
Year:
1994

Citing 6
Cited 1

Reducing bias and inefficiency in the selection algorithm

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best

Proceedings of the third international conference on Genetic algorithms
Error-Correction Coding for Digital Communications

Error-Correction Coding for Digital Communications
Distributed Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
Parallel Genetic Algorithms Population Genetics and Combinatorial Optimization

Proceedings of the 3rd International Conference on Genetic Algorithms
Fine-Grained Parallel Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms

Reduced complexity iterative decoding of 3D-product block codes based on genetic algorithms

Journal of Electrical and Computer Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Soft-decision decoding is an NP-hard problem of great interest to developers of communication systems. We show that this problem is equivalent to the problem of optimizing Walsh polynomials. We present genetic algorithms for soft-decision decoding of binary linear block codes and compare the performance with various other decoding algorithms including the currently developed A* algorithm. Simulation results show that our algorithms achieve bit-error-probabilities as low as 0.00183 for a [104,52] code with a low signal-to-noise ratio of 2.5 dB, exploring only 22,400 codewords, whereas the search space contains 4.5 × 10l5 codewords. We define a new crossover operator that exploits domain-specific information and compare it with uniform and two-point crossover.