On trapping sets and guaranteed error correction capability ofLDPC codes and GLDPC codes

Shashi Kiran Chilappagari, Dung Viet Nguyen, Bane V Vasic, Michael W Marcellin

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

The relation between the girth and the guaranteed error correction capability of γ-left-regular low-density parity-check (LDPC) codes when decoded using the bit flipping (serial and parallel) algorithms is investigated. A lower bound on the size of variable node sets which expand by a factor of at least 3γ/4 is found based on the Moore bound. This bound, combined with the well known expander based arguments, leads to a lower bound on the guaranteed error correction capability. The decoding failures of the bit flipping algorithms are characterized using the notions of trapping sets and fixed sets. The relation between fixed sets and a class of graphs known as cage graphs is studied. Upper bounds on the guaranteed error correction capability are then established based on the order of cage graphs. The results are extended to left-regular and right-uniform generalized LDPC codes. It is shown that this class of generalized LDPC codes can correct a linear number of worst case errors (in the code length) under the parallel bit flipping algorithm when the underlying Tanner graph is a good expander. A lower bound on the size of variable node sets which have the required expansion is established.

Original languageEnglish (US)
Article number5437420
Pages (from-to)1600-1611
Number of pages12
JournalIEEE Transactions on Information Theory
Volume56
Issue number4
DOIs
StatePublished - Apr 2010

Fingerprint

Error correction
Parallel algorithms
Decoding

Keywords

  • Bit flipping algorithms
  • Error correction capability
  • Fixed sets
  • Generalized low-density parity-check (LDPC) codes
  • Low-density parity-check (LDPC) codes
  • Trapping sets

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

On trapping sets and guaranteed error correction capability ofLDPC codes and GLDPC codes. / Chilappagari, Shashi Kiran; Nguyen, Dung Viet; Vasic, Bane V; Marcellin, Michael W.

In: IEEE Transactions on Information Theory, Vol. 56, No. 4, 5437420, 04.2010, p. 1600-1611.

Research output: Contribution to journalArticle

@article{418f38bcd5bd437eba6ed1265cdfccd7,
title = "On trapping sets and guaranteed error correction capability ofLDPC codes and GLDPC codes",
abstract = "The relation between the girth and the guaranteed error correction capability of γ-left-regular low-density parity-check (LDPC) codes when decoded using the bit flipping (serial and parallel) algorithms is investigated. A lower bound on the size of variable node sets which expand by a factor of at least 3γ/4 is found based on the Moore bound. This bound, combined with the well known expander based arguments, leads to a lower bound on the guaranteed error correction capability. The decoding failures of the bit flipping algorithms are characterized using the notions of trapping sets and fixed sets. The relation between fixed sets and a class of graphs known as cage graphs is studied. Upper bounds on the guaranteed error correction capability are then established based on the order of cage graphs. The results are extended to left-regular and right-uniform generalized LDPC codes. It is shown that this class of generalized LDPC codes can correct a linear number of worst case errors (in the code length) under the parallel bit flipping algorithm when the underlying Tanner graph is a good expander. A lower bound on the size of variable node sets which have the required expansion is established.",
keywords = "Bit flipping algorithms, Error correction capability, Fixed sets, Generalized low-density parity-check (LDPC) codes, Low-density parity-check (LDPC) codes, Trapping sets",
author = "Chilappagari, {Shashi Kiran} and Nguyen, {Dung Viet} and Vasic, {Bane V} and Marcellin, {Michael W}",
year = "2010",
month = "4",
doi = "10.1109/TIT.2010.2040962",
language = "English (US)",
volume = "56",
pages = "1600--1611",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - On trapping sets and guaranteed error correction capability ofLDPC codes and GLDPC codes

AU - Chilappagari, Shashi Kiran

AU - Nguyen, Dung Viet

AU - Vasic, Bane V

AU - Marcellin, Michael W

PY - 2010/4

Y1 - 2010/4

N2 - The relation between the girth and the guaranteed error correction capability of γ-left-regular low-density parity-check (LDPC) codes when decoded using the bit flipping (serial and parallel) algorithms is investigated. A lower bound on the size of variable node sets which expand by a factor of at least 3γ/4 is found based on the Moore bound. This bound, combined with the well known expander based arguments, leads to a lower bound on the guaranteed error correction capability. The decoding failures of the bit flipping algorithms are characterized using the notions of trapping sets and fixed sets. The relation between fixed sets and a class of graphs known as cage graphs is studied. Upper bounds on the guaranteed error correction capability are then established based on the order of cage graphs. The results are extended to left-regular and right-uniform generalized LDPC codes. It is shown that this class of generalized LDPC codes can correct a linear number of worst case errors (in the code length) under the parallel bit flipping algorithm when the underlying Tanner graph is a good expander. A lower bound on the size of variable node sets which have the required expansion is established.

AB - The relation between the girth and the guaranteed error correction capability of γ-left-regular low-density parity-check (LDPC) codes when decoded using the bit flipping (serial and parallel) algorithms is investigated. A lower bound on the size of variable node sets which expand by a factor of at least 3γ/4 is found based on the Moore bound. This bound, combined with the well known expander based arguments, leads to a lower bound on the guaranteed error correction capability. The decoding failures of the bit flipping algorithms are characterized using the notions of trapping sets and fixed sets. The relation between fixed sets and a class of graphs known as cage graphs is studied. Upper bounds on the guaranteed error correction capability are then established based on the order of cage graphs. The results are extended to left-regular and right-uniform generalized LDPC codes. It is shown that this class of generalized LDPC codes can correct a linear number of worst case errors (in the code length) under the parallel bit flipping algorithm when the underlying Tanner graph is a good expander. A lower bound on the size of variable node sets which have the required expansion is established.

KW - Bit flipping algorithms

KW - Error correction capability

KW - Fixed sets

KW - Generalized low-density parity-check (LDPC) codes

KW - Low-density parity-check (LDPC) codes

KW - Trapping sets

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

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

U2 - 10.1109/TIT.2010.2040962

DO - 10.1109/TIT.2010.2040962

M3 - Article

VL - 56

SP - 1600

EP - 1611

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 4

M1 - 5437420

ER -