Performance of LDPC codes under noisy message-passing decoding

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

Abstract

In traditional communication theory, it is assumed that error correcting codes may be decoded with algorithms that perform perfectly. Noise, however, provides a fundamental limit to computation systems just as it does to communication systems. In this work, we investigate the effect of noise in message-passing decoders for low-density parity-check codes. We observe that the concentration of the performance of the decoder around its average performance continues to hold when noise is introduced into message-passing. Given the concentration result, density evolution equations for a simple noisy message-passing decoder are derived. Analytic computation of thresholds shows that performance degrades smoothly as decoder noise increases. Decoding is robust to noise in the decoder.

Original languageEnglish (US)
Title of host publication2007 IEEE Information Theory Workshop, ITW 2007, Proceedings
Pages178-183
Number of pages6
DOIs
StatePublished - 2007
Externally publishedYes
Event2007 IEEE Information Theory Workshop, ITW 2007 - Lake Tahoe, CA, United States
Duration: Sep 2 2007Sep 6 2007

Publication series

Name2007 IEEE Information Theory Workshop, ITW 2007, Proceedings

Other

Other2007 IEEE Information Theory Workshop, ITW 2007
Country/TerritoryUnited States
CityLake Tahoe, CA
Period9/2/079/6/07

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'Performance of LDPC codes under noisy message-passing decoding'. Together they form a unique fingerprint.

Cite this