Title of article
A New Iterative Threshold Decoding Algorithm for One Step Majority Logic Decodable Block Codes
Author/Authors
M. Lahmer، نويسنده , , M. Belkasmi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
7
From page
12
To page
18
Abstract
The performance of iterative decoding algorithm for one-step majority logic decodable (OSMLD) codes is investigated. We introduce a new soft-in soft-out of APP threshold algorithm which is able to decode theses codes nearly as well as belief propagation (BP) algorithm. However the computation time of the proposed algorithm is very low. The developed algorithm can also be applied to product codes and parallel concatenated codes based on block codes. Numerical results on both AWGN and Rayleigh channels are provided. The performance of iterative decoding of parallel concatenated code (17633,8595) with rate 5 is only 1.8 dB away from the Shannon capacity limit at a BER of 10-5.
Keywords
product codes , OSMLD , iterative threshold decoding , One step majority logic decodable codes , parallel concatenated block codes
Journal title
International Journal of Computer Applications
Serial Year
2010
Journal title
International Journal of Computer Applications
Record number
660144
Link To Document