Reduced Complexity Iterative Decoding of 3D-Product Block Codes Based on Genetic Algorithms
Two iterative decoding algorithms of 3D-product block codes (3D-PBC) based on genetic algorithms (GAs) are presented. The first algorithm uses the Chase-Pyndiah SISO, and the second one uses the list-based SISO decoding algorithm (LBDA) based on order-𝑖 reprocessing. We applied these algorithms over...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Journal of Electrical and Computer Engineering |
| Online Access: | http://dx.doi.org/10.1155/2012/609650 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832554965939257344 |
|---|---|
| author | Abdeslam Ahmadi Faissal El Bouanani Hussain Ben-Azza Youssef Benghabrit |
| author_facet | Abdeslam Ahmadi Faissal El Bouanani Hussain Ben-Azza Youssef Benghabrit |
| author_sort | Abdeslam Ahmadi |
| collection | DOAJ |
| description | Two iterative decoding algorithms of 3D-product block codes (3D-PBC) based on genetic algorithms (GAs) are presented. The first algorithm uses the Chase-Pyndiah SISO, and the second one uses the list-based SISO decoding algorithm (LBDA) based on order-𝑖 reprocessing. We applied these algorithms over AWGN channel to symmetric 3D-PBC constructed from BCH codes. The simulation results show that the first algorithm outperforms the Chase-Pyndiah one and is only 1.38 dB away from the Shannon capacity limit at BER of 10−5 for BCH (31, 21, 5)3 and 1.4 dB for BCH (16, 11, 4)3. The simulations of the LBDA-based GA on the BCH (16, 11, 4)3 show that its performances outperform the first algorithm and is about 1.33 dB from the Shannon limit. Furthermore, these algorithms can be applied to any arbitrary 3D binary product block codes, without the need of a hard-in hard-out decoder. We show also that the two proposed decoders are less complex than both Chase-Pyndiah algorithm for codes with large correction capacity and LBDA for large 𝑖 parameter. Those features make the decoders based on genetic algorithms efficient and attractive. |
| format | Article |
| id | doaj-art-817db8b7fcc949fe8926bb9c366cb44a |
| institution | Kabale University |
| issn | 2090-0147 2090-0155 |
| language | English |
| publishDate | 2012-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Electrical and Computer Engineering |
| spelling | doaj-art-817db8b7fcc949fe8926bb9c366cb44a2025-02-03T05:49:56ZengWileyJournal of Electrical and Computer Engineering2090-01472090-01552012-01-01201210.1155/2012/609650609650Reduced Complexity Iterative Decoding of 3D-Product Block Codes Based on Genetic AlgorithmsAbdeslam Ahmadi0Faissal El Bouanani1Hussain Ben-Azza2Youssef Benghabrit3Department of Industrial and Production Engineering, Moulay Ismail University, Ecole Nationale Supérieure d'Arts et Métiers, Meknès 50000, MoroccoDepartment of Communication Networks, Ecole Nationale Supérieure d'Informatique et d'Analyse des Systèmes, Rabat 10000, MoroccoDepartment of Industrial and Production Engineering, Moulay Ismail University, Ecole Nationale Supérieure d'Arts et Métiers, Meknès 50000, MoroccoDepartment of Industrial and Production Engineering, Moulay Ismail University, Ecole Nationale Supérieure d'Arts et Métiers, Meknès 50000, MoroccoTwo iterative decoding algorithms of 3D-product block codes (3D-PBC) based on genetic algorithms (GAs) are presented. The first algorithm uses the Chase-Pyndiah SISO, and the second one uses the list-based SISO decoding algorithm (LBDA) based on order-𝑖 reprocessing. We applied these algorithms over AWGN channel to symmetric 3D-PBC constructed from BCH codes. The simulation results show that the first algorithm outperforms the Chase-Pyndiah one and is only 1.38 dB away from the Shannon capacity limit at BER of 10−5 for BCH (31, 21, 5)3 and 1.4 dB for BCH (16, 11, 4)3. The simulations of the LBDA-based GA on the BCH (16, 11, 4)3 show that its performances outperform the first algorithm and is about 1.33 dB from the Shannon limit. Furthermore, these algorithms can be applied to any arbitrary 3D binary product block codes, without the need of a hard-in hard-out decoder. We show also that the two proposed decoders are less complex than both Chase-Pyndiah algorithm for codes with large correction capacity and LBDA for large 𝑖 parameter. Those features make the decoders based on genetic algorithms efficient and attractive.http://dx.doi.org/10.1155/2012/609650 |
| spellingShingle | Abdeslam Ahmadi Faissal El Bouanani Hussain Ben-Azza Youssef Benghabrit Reduced Complexity Iterative Decoding of 3D-Product Block Codes Based on Genetic Algorithms Journal of Electrical and Computer Engineering |
| title | Reduced Complexity Iterative Decoding of 3D-Product Block Codes Based on Genetic Algorithms |
| title_full | Reduced Complexity Iterative Decoding of 3D-Product Block Codes Based on Genetic Algorithms |
| title_fullStr | Reduced Complexity Iterative Decoding of 3D-Product Block Codes Based on Genetic Algorithms |
| title_full_unstemmed | Reduced Complexity Iterative Decoding of 3D-Product Block Codes Based on Genetic Algorithms |
| title_short | Reduced Complexity Iterative Decoding of 3D-Product Block Codes Based on Genetic Algorithms |
| title_sort | reduced complexity iterative decoding of 3d product block codes based on genetic algorithms |
| url | http://dx.doi.org/10.1155/2012/609650 |
| work_keys_str_mv | AT abdeslamahmadi reducedcomplexityiterativedecodingof3dproductblockcodesbasedongeneticalgorithms AT faissalelbouanani reducedcomplexityiterativedecodingof3dproductblockcodesbasedongeneticalgorithms AT hussainbenazza reducedcomplexityiterativedecodingof3dproductblockcodesbasedongeneticalgorithms AT youssefbenghabrit reducedcomplexityiterativedecodingof3dproductblockcodesbasedongeneticalgorithms |