Finite alphabet iterative decoders for LDPC codes surpassing floating-point iterative decoders
AffiliationUniv Arizona, Dept Elect & Comp Engn
MetadataShow full item record
CitationS. K. Planjery, D. Declercq, L. Danjean and B. Vasic, "Finite alphabet iterative decoders for LDPC codes surpassing floating-point iterative decoders," in Electronics Letters, vol. 47, no. 16, pp. 919-921, 4 Aug. 2011, doi: 10.1049/el.2011.1184.
RightsCopyright © The Institution of Engineering and Technology 2011.
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at email@example.com.
AbstractIntroduced 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.
VersionFinal accepted manuscript