Decoder based on Parallel Genetic Algorithm and Multi-objective Optimization for Low Density Parity Check Codes

Genetic algorithms are powerful search techniques that are used successfully to solve problems in many different disciplines. This article introduces a new Parallel Genetic Algorithm for decoding LDPC codes (PGAD). The results show that the proposed algorithm gives large gains over the Sum-Product decoder, which proves its efficiency. We also show that the fitness function must be improved by Multi-objective Optimization, for this, we applied the Weighted Sum method to improve PGAD, this new version is called (MOGAD) gives higher performance compared to one. Keywords: Parallel Genetic Algorithms decoder, Sum-Product decoder, Fitness Function, LDPC codes, Error correcting codes, Multi-objective optimization, Weighted sum method.

[1]  Jean-Claude Vansnick,et al.  Measurement Theory and Decision Aid , 1990 .

[2]  John J. Grefenstette,et al.  A Parallel Genetic Algorithm , 1987, ICGA.

[3]  Sheroz Khan,et al.  Performance Evaluation of Low Density Parity Check Codes , 2007 .

[4]  Yilmaz Kaya,et al.  A Novel Crossover Operator for Genetic Algorithms: Ring Crossover , 2011, ArXiv.

[5]  Kishan G. Mehrotra,et al.  Genetic Algorithms for Soft-Decision Decoding of Linear Block Codes , 1994, Evolutionary Computation.

[6]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[7]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[8]  Ahmed Azouaoui,et al.  Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms , 2012, J. Electr. Comput. Eng..

[9]  Seyed Saeed Mirpour Marzuni,et al.  Comparing performance of parallel grouping genetic algorithm with serial grouping genetic algorithm for clustering problems , 2015 .

[10]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[11]  Shisanu Tongchim.  Coarse-Grained Parallel Genetic Algorithm for Solving the Timetable Problem , 1999 .

[12]  C. Hartmann,et al.  Efficient Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes Using Algorithm A* , 1993, Proceedings. IEEE International Symposium on Information Theory.

[13]  David E. Goldberg,et al.  Sizing Populations for Serial and Parallel Genetic Algorithms , 1989, ICGA.

[14]  Heinz Mühlenbein,et al.  Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization , 1989, Parallelism, Learning, Evolution.

[15]  Erick Cantú-Paz,et al.  A Survey of Parallel Genetic Algorithms , 2000 .

[16]  Carlos A. Bana e Costa,et al.  Readings in Multiple Criteria Decision Aid , 2011 .

[17]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[18]  Daoben Li,et al.  Evaluation of low density parity-check codes on frequency-selective fading channels , 2005, IEEE International Symposium on Communications and Information Technology, 2005. ISCIT 2005..

[19]  J. Dennis,et al.  A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems , 1997 .

[20]  Olivier de Weck,et al.  Adaptive Weighted Sum Method for Bi-objective Optimization , 2004 .

[21]  Henk Wymeersch,et al.  Log-domain decoding of LDPC codes over GF(q) , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[22]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[23]  Zbigniew Michalewicz,et al.  An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms , 1991, ICGA.