Approaching maximum likelihood decoding of finite length LDPC codes via FAID diversity

David Declercq, Erbao Li, Bane Vasić, Shiva K. Planjery

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

We introduce a generic approach, called FAID diversity, for improving the error correction capability of regular low-density parity check codes, beyond the belief propagation performance. The method relies on operating a set of finite alphabet iterative decoders (FAID). The message-passing update rules are interpreted as discrete dynamical systems, and are judiciously chosen to ensure that decoders have different dynamics on a specific finite-length code. An algorithm is proposed which uses random jumps in the iterative message passing trajectories, such that the system is not trapped in periodic attractors. We show by simulations that the FAID diversity approach with random jumps has the potential of approaching the performance of maximum-likelihood decoding for finite-length regular, column-weight three codes.

Original languageEnglish (US)
Title of host publication2012 IEEE Information Theory Workshop, ITW 2012
Pages487-491
Number of pages5
DOIs
StatePublished - Dec 1 2012
Event2012 IEEE Information Theory Workshop, ITW 2012 - Lausanne, Switzerland
Duration: Sep 3 2012Sep 7 2012

Publication series

Name2012 IEEE Information Theory Workshop, ITW 2012

Other

Other2012 IEEE Information Theory Workshop, ITW 2012
CountrySwitzerland
CityLausanne
Period9/3/129/7/12

ASJC Scopus subject areas

  • Information Systems

Fingerprint Dive into the research topics of 'Approaching maximum likelihood decoding of finite length LDPC codes via FAID diversity'. Together they form a unique fingerprint.

  • Cite this

    Declercq, D., Li, E., Vasić, B., & Planjery, S. K. (2012). Approaching maximum likelihood decoding of finite length LDPC codes via FAID diversity. In 2012 IEEE Information Theory Workshop, ITW 2012 (pp. 487-491). [6404721] (2012 IEEE Information Theory Workshop, ITW 2012). https://doi.org/10.1109/ITW.2012.6404721