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

DOI10.1155/2012/609650MaRDI QIDQ693830zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Abdeslam Ahmadi, Faissal El Bouanani, Hussain Ben-Azza, Youssef Benghabrit

Publication date 11 December 2012

Published in Journal of Electrical and Computer Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2012/609650

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decoding (94B35) Other types of codes (94B60)

Review text

Summary: 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-\(i\) 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 \(i\) parameter. Those features make the decoders based on genetic algorithms efficient and attractive.

Recommendations

• Efficient dual domain decoding of linear block codes using genetic algorithms
• Near-optimum decoding of product codes: Block turbo codes
• Iterative decoding of binary block and convolutional codes
• scientific article; zbMATH DE number 2077096
• Improved BP-based decoding algorithms integrated with GA for LDPC codes

Cites work

• A recursive approach to low complexity codes
• Class of algorithms for decoding block codes with channel measurement information
• Good codes based on very sparse matrices
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 6433928 (Why is no real title available?)

Cited in

(3)

• Improved multiuser detectors employing genetic algorithms in a space-time block coded system
• Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
• Efficient dual domain decoding of linear block codes using genetic algorithms

This page was built for publication: Reduced complexity iterative decoding of 3D-product block codes based on genetic algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693830)