Iterative decoding beyond belief propagation

Shiva Kumar Planjery, Shashi Kiran Chilappagari, Bane V Vasic, David Declercq, Ludovic Danjean

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

8 Citations (Scopus)

Abstract

At the heart of modern coding theory lies the fact that low-density parity-check (LDPC) codes can be efficiently decoded by belief propagation (BP). The BP is an inference algorithm which operates on a graphical model of a code, and lends itself to low-complexity and high-speed implementations, making it the algorithm of choice in many applications. It has unprecedentedly good error rate performance, so good that when decoded by the BP, LDPC codes approach theoretical limits of channel capacity. However, this capacity approaching property holds only in the asymptotic limit of code length, while codes of practical lengths suffer abrupt performance degradation in the low noise regime known as the error floor phenomenon. Our study of error floor has led to an interesting and surprising finding that it is possible to design iterative decoders which are much simpler yet better than belief propagation! These decoders do not propagate beliefs but a rather different kind of messages that reflect the local structure of the code graph. This has opened a plethora of exciting theoretical problems and applications. This paper introduces this new paradigm.

Original languageEnglish (US)
Title of host publication2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings
Pages515-524
Number of pages10
DOIs
StatePublished - 2010
Event2010 Information Theory and Applications Workshop, ITA 2010 - San Diego, CA, United States
Duration: Jan 31 2010Feb 5 2010

Other

Other2010 Information Theory and Applications Workshop, ITA 2010
CountryUnited States
CitySan Diego, CA
Period1/31/102/5/10

Fingerprint

Iterative decoding
Channel capacity
Degradation

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Planjery, S. K., Chilappagari, S. K., Vasic, B. V., Declercq, D., & Danjean, L. (2010). Iterative decoding beyond belief propagation. In 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings (pp. 515-524). [5454076] https://doi.org/10.1109/ITA.2010.5454076

Iterative decoding beyond belief propagation. / Planjery, Shiva Kumar; Chilappagari, Shashi Kiran; Vasic, Bane V; Declercq, David; Danjean, Ludovic.

2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings. 2010. p. 515-524 5454076.

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

Planjery, SK, Chilappagari, SK, Vasic, BV, Declercq, D & Danjean, L 2010, Iterative decoding beyond belief propagation. in 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings., 5454076, pp. 515-524, 2010 Information Theory and Applications Workshop, ITA 2010, San Diego, CA, United States, 1/31/10. https://doi.org/10.1109/ITA.2010.5454076
Planjery SK, Chilappagari SK, Vasic BV, Declercq D, Danjean L. Iterative decoding beyond belief propagation. In 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings. 2010. p. 515-524. 5454076 https://doi.org/10.1109/ITA.2010.5454076
Planjery, Shiva Kumar ; Chilappagari, Shashi Kiran ; Vasic, Bane V ; Declercq, David ; Danjean, Ludovic. / Iterative decoding beyond belief propagation. 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings. 2010. pp. 515-524
@inproceedings{3b6161e37dd54d5aa394747dca91b577,
title = "Iterative decoding beyond belief propagation",
abstract = "At the heart of modern coding theory lies the fact that low-density parity-check (LDPC) codes can be efficiently decoded by belief propagation (BP). The BP is an inference algorithm which operates on a graphical model of a code, and lends itself to low-complexity and high-speed implementations, making it the algorithm of choice in many applications. It has unprecedentedly good error rate performance, so good that when decoded by the BP, LDPC codes approach theoretical limits of channel capacity. However, this capacity approaching property holds only in the asymptotic limit of code length, while codes of practical lengths suffer abrupt performance degradation in the low noise regime known as the error floor phenomenon. Our study of error floor has led to an interesting and surprising finding that it is possible to design iterative decoders which are much simpler yet better than belief propagation! These decoders do not propagate beliefs but a rather different kind of messages that reflect the local structure of the code graph. This has opened a plethora of exciting theoretical problems and applications. This paper introduces this new paradigm.",
author = "Planjery, {Shiva Kumar} and Chilappagari, {Shashi Kiran} and Vasic, {Bane V} and David Declercq and Ludovic Danjean",
year = "2010",
doi = "10.1109/ITA.2010.5454076",
language = "English (US)",
isbn = "9781424470143",
pages = "515--524",
booktitle = "2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings",

}

TY - GEN

T1 - Iterative decoding beyond belief propagation

AU - Planjery, Shiva Kumar

AU - Chilappagari, Shashi Kiran

AU - Vasic, Bane V

AU - Declercq, David

AU - Danjean, Ludovic

PY - 2010

Y1 - 2010

N2 - At the heart of modern coding theory lies the fact that low-density parity-check (LDPC) codes can be efficiently decoded by belief propagation (BP). The BP is an inference algorithm which operates on a graphical model of a code, and lends itself to low-complexity and high-speed implementations, making it the algorithm of choice in many applications. It has unprecedentedly good error rate performance, so good that when decoded by the BP, LDPC codes approach theoretical limits of channel capacity. However, this capacity approaching property holds only in the asymptotic limit of code length, while codes of practical lengths suffer abrupt performance degradation in the low noise regime known as the error floor phenomenon. Our study of error floor has led to an interesting and surprising finding that it is possible to design iterative decoders which are much simpler yet better than belief propagation! These decoders do not propagate beliefs but a rather different kind of messages that reflect the local structure of the code graph. This has opened a plethora of exciting theoretical problems and applications. This paper introduces this new paradigm.

AB - At the heart of modern coding theory lies the fact that low-density parity-check (LDPC) codes can be efficiently decoded by belief propagation (BP). The BP is an inference algorithm which operates on a graphical model of a code, and lends itself to low-complexity and high-speed implementations, making it the algorithm of choice in many applications. It has unprecedentedly good error rate performance, so good that when decoded by the BP, LDPC codes approach theoretical limits of channel capacity. However, this capacity approaching property holds only in the asymptotic limit of code length, while codes of practical lengths suffer abrupt performance degradation in the low noise regime known as the error floor phenomenon. Our study of error floor has led to an interesting and surprising finding that it is possible to design iterative decoders which are much simpler yet better than belief propagation! These decoders do not propagate beliefs but a rather different kind of messages that reflect the local structure of the code graph. This has opened a plethora of exciting theoretical problems and applications. This paper introduces this new paradigm.

UR - http://www.scopus.com/inward/record.url?scp=77952728637&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77952728637&partnerID=8YFLogxK

U2 - 10.1109/ITA.2010.5454076

DO - 10.1109/ITA.2010.5454076

M3 - Conference contribution

SN - 9781424470143

SP - 515

EP - 524

BT - 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings

ER -