Instanton-based techniques for analysis and reduction of error floors of LDPC codes

Shashi Kiran Chilappagari, Michael Chertkov, Mikhail Stepanov, Bane V Vasic

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC). The instanton analysis suggests that the underlying topological structures of the most probable instanton of the same code but different channels and decoders are related to each other. Armed with this understanding of the graphical structure of the instanton and its relation to the decoding failures, we suggest a method to construct codes whose Tanner graphs are free of these structures, and thus have less significant error floors.

Original languageEnglish (US)
Article number5174515
Pages (from-to)855-865
Number of pages11
JournalIEEE Journal on Selected Areas in Communications
Volume27
Issue number6
DOIs
StatePublished - Aug 2009

Fingerprint

Decoding
Linear programming

Keywords

  • Error Floor
  • Instantons
  • Iterative Decoding
  • Linear Programming Decoding
  • Low-density parity-check codes
  • Pseudo-Codewords
  • Trapping Sets

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Instanton-based techniques for analysis and reduction of error floors of LDPC codes. / Chilappagari, Shashi Kiran; Chertkov, Michael; Stepanov, Mikhail; Vasic, Bane V.

In: IEEE Journal on Selected Areas in Communications, Vol. 27, No. 6, 5174515, 08.2009, p. 855-865.

Research output: Contribution to journalArticle

@article{13a2a23aee42470da966da5a9e4d1f8f,
title = "Instanton-based techniques for analysis and reduction of error floors of LDPC codes",
abstract = "We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC). The instanton analysis suggests that the underlying topological structures of the most probable instanton of the same code but different channels and decoders are related to each other. Armed with this understanding of the graphical structure of the instanton and its relation to the decoding failures, we suggest a method to construct codes whose Tanner graphs are free of these structures, and thus have less significant error floors.",
keywords = "Error Floor, Instantons, Iterative Decoding, Linear Programming Decoding, Low-density parity-check codes, Pseudo-Codewords, Trapping Sets",
author = "Chilappagari, {Shashi Kiran} and Michael Chertkov and Mikhail Stepanov and Vasic, {Bane V}",
year = "2009",
month = "8",
doi = "10.1109/JSAC.2009.090804",
language = "English (US)",
volume = "27",
pages = "855--865",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Instanton-based techniques for analysis and reduction of error floors of LDPC codes

AU - Chilappagari, Shashi Kiran

AU - Chertkov, Michael

AU - Stepanov, Mikhail

AU - Vasic, Bane V

PY - 2009/8

Y1 - 2009/8

N2 - We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC). The instanton analysis suggests that the underlying topological structures of the most probable instanton of the same code but different channels and decoders are related to each other. Armed with this understanding of the graphical structure of the instanton and its relation to the decoding failures, we suggest a method to construct codes whose Tanner graphs are free of these structures, and thus have less significant error floors.

AB - We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC). The instanton analysis suggests that the underlying topological structures of the most probable instanton of the same code but different channels and decoders are related to each other. Armed with this understanding of the graphical structure of the instanton and its relation to the decoding failures, we suggest a method to construct codes whose Tanner graphs are free of these structures, and thus have less significant error floors.

KW - Error Floor

KW - Instantons

KW - Iterative Decoding

KW - Linear Programming Decoding

KW - Low-density parity-check codes

KW - Pseudo-Codewords

KW - Trapping Sets

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

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

U2 - 10.1109/JSAC.2009.090804

DO - 10.1109/JSAC.2009.090804

M3 - Article

AN - SCOPUS:84055222321

VL - 27

SP - 855

EP - 865

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 6

M1 - 5174515

ER -