A New Iterative Threshold Decoding Algorithm for One Step Majority Logic Decodable Block Codes

Mohammed Lahmer, Mostafa Belkasmi · International Journal of Computer Applications · 2010

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 0.5 is only 1.8 dB away from the Shannon capacity limit at a BER of 10 -5 .

Read the paper · More papers on PaperTik