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

Mohammed Lahmer | Zendy; Mostafa Belkasmi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Mohammed Lahmer,

Mostafa Belkasmi

Publication year - 2010

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/1265-1697

Subject(s) - computer science , decoding methods , block (permutation group theory) , algorithm , block code , theoretical computer science , mathematics , geometry

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. General Terms Information theory and Coding, Signal Processing.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research