Finite alphabet iterative decoders for LDPC codes surpassing floating-point iterative decoders | Zendy

Shiva Kumar Planjery | Zendy; David Declercq | Zendy; Ludovic Danjean | Zendy; Bane Vasić | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Finite alphabet iterative decoders for LDPC codes surpassing floating-point iterative decoders

Author(s) -

Shiva Kumar Planjery,

David Declercq,

Ludovic Danjean,

Bane Vasić

Publication year - 2011

Publication title -

electronics letters

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.375

H-Index - 146

eISSN - 1350-911X

pISSN - 0013-5194

DOI - 10.1049/el.2011.1184

Subject(s) - low density parity check code , belief propagation , message passing , algorithm , decoding methods , binary number , computer science , error floor , alphabet , factor graph , representation (politics) , channel (broadcasting) , bit error rate , floating point , parity bit , theoretical computer science , error detection and correction , turbo code , mathematics , arithmetic , parallel computing , telecommunications , linguistics , philosophy , politics , political science , law

Introduced is a new type of message-passing (MP) decoders for low-density parity-check (LDPC) codes over the binary symmetric channel. Unlike traditional belief propagation (BP) based MP algorithms which propagate probabilities or log-likelihoods, the new MP decoders propagate messages requiring only a finite number of bits for their representation in such a way that good performance in the error floor region is ensured. Additionally, these messages are not quantised probabilities or log-likelihoods. As examples, MP decoders are provided that require only three bits for message representation, but surpass the floating-point BP (which requires a large number of bits for representation) in the error-floor region.

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