@conference { ISI:000363271300045, title = {New Iterative Decoding Algorithms of 2D Product Block Codes}, booktitle = {2014 WORLD CONGRESS ON COMPUTER APPLICATIONS AND INFORMATION SYSTEMS (WCCAIS)}, year = {2014}, note = {World Congress on Computer Applications and Information Systems (WCCAIS), Hammamet, TUNISIA, JAN 17-19, 2014}, abstract = {This paper presents four new iterative decoders for two dimensional product block codes (2D-PBC) based on Genetic Algorithms. Each of these iterative decoders runs in parallel on a number of processors connected by a network. They have almost the same complexity as the conventional iterative decoder, but their performances are improved since at each iteration, they trap the better of extrinsic information computed by the elementary decoders running simultaneously on all processors.}, isbn = {978-1-4799-3351-8}, author = {Ahmadi, Abdeslam and El Bouanani, Faissal and Ben-Azza, Hussain} } @article {8699111820120101, title = {Reduced Complexity Iterative Decoding of 3D-Product Block Codes Based on Genetic Algorithms.}, journal = {Journal of Electrical \& Computer Engineering}, year = {2012}, pages = {1 - 8}, abstract = {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){\textthreesuperior} and 1.4 dB for BCH (16, 11, 4){\textthreesuperior}. The simulations of the LBDA-based GA on the BCH (16, 11, 4){\textthreesuperior} 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 hardout decoder. We show also that the two proposed decoders are less complex than both Chase-Pyndiah algorithm for codes with large corr}, keywords = {Computational complexity, Computer simulation, Genetic algorithms, Iterative decoding, Performance evaluation, Three-dimensional imaging}, issn = {20900147}, url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=86991118\&site=ehost-live}, author = {Ahmadi, Abdeslam and Bouanani, Faissal El and Ben-Azza, Hussain and Benghabrit, Youssef} }