On adaptive reduced-complexity iterative decoding

2002 ◽  
Author(s):  
P.A. Martin ◽  
D.P. Taylor
Keyword(s):  
Iterative Decoding ◽  
Reduced Complexity

scholarly journals Reduced Complexity Iterative Decoding of 3D-Product Block Codes Based on Genetic Algorithms

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Abdeslam Ahmadi ◽  
Faissal El Bouanani ◽  
Hussain Ben-Azza ◽  
Youssef Benghabrit
Keyword(s):  
Genetic Algorithms ◽  
Iterative Decoding ◽  
Block Codes ◽  
Shannon Capacity ◽  
Large Parameter ◽  
Decoding Algorithms ◽  
Capacity Limit ◽  
Large Correction ◽  
Reduced Complexity ◽  
Simulation Results

Two iterative decoding algorithms of 3D-product block codes (3D-PBC) based on genetic algorithms (GAs) are presented. The first algorithm uses the Chase-PyndiahSISO, and the second one uses the list-basedSISOdecoding algorithm (LBDA) based on order- reprocessing. We applied these algorithms overAWGNchannel to symmetric3D-PBCconstructed fromBCHcodes. 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 forBCH(31, 21, 5)3and 1.4 dB forBCH(16, 11, 4)3. The simulations of the LBDA-basedGAon theBCH(16, 11, 4)3show 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.

Sign in / Sign up

Export Citation Format

Share Document