Finite alphabet iterative decoders approaching maximum likelihood performance on the binary symmetric channel

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

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

4 Scopus citations

Abstract

We introduce a generic approach for improving the guaranteed error correction capability of regular low-density parity check codes. The method relies on operating (in serial or in parallel) a set of finite alphabet iterative decoders. The message passing update rules are judiciously chosen to ensure that decoders have different dynamics on a specific finite-length code. The idea is that for the Binary Symmetric Channel, if some error pattern cannot be corrected by one particular decoder, there exists in the set of decoders, another decoder which can correct this pattern. We show how to select a plurality of message update rules so that the set of decoders can collectively correct error patterns on the dominant trapping sets. We also show that a set of decoders with dynamic re-initializations can approach the performance of maximum likelihood decoding for finite-length regular column-weight three codes.

Original languageEnglish (US)
Title of host publication2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings
Pages23-32
Number of pages10
DOIs
StatePublished - May 7 2012
Event2012 Information Theory and Applications Workshop, ITA 2012 - San Diego, CA, United States
Duration: Feb 5 2012Feb 10 2012

Publication series

Name2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings

Other

Other2012 Information Theory and Applications Workshop, ITA 2012
CountryUnited States
CitySan Diego, CA
Period2/5/122/10/12

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Fingerprint Dive into the research topics of 'Finite alphabet iterative decoders approaching maximum likelihood performance on the binary symmetric channel'. Together they form a unique fingerprint.

  • Cite this

    Declercq, D., Vasić, B., Planjery, S. K., & Li, E. (2012). Finite alphabet iterative decoders approaching maximum likelihood performance on the binary symmetric channel. In 2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings (pp. 23-32). [6181824] (2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings). https://doi.org/10.1109/ITA.2012.6181824