Girth of the tanner graph and error correction capability of LDPC codes

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

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

2 Citations (Scopus)

Abstract

We investigate the relation between the girth and the guaranteed error correction capability of γ-left regular LDPC codes. For column-weight-three codes, we give upper and lower bounds on the number of errors correctable by the Gallager A algorithm. For higher column weight codes, we find the number of variable nodes which are guaranteed to expand by a factor of at least 3γ/4, hence giving a lower bound on the guaranteed correction capability under the bit flipping (serial and parallel) algorithms. We also establish upper bounds by studying the sizes of smallest possible trapping sets.

Original languageEnglish (US)
Title of host publication46th Annual Allerton Conference on Communication, Control, and Computing
Pages1238-1245
Number of pages8
DOIs
StatePublished - 2008
Event46th Annual Allerton Conference on Communication, Control, and Computing - Monticello, IL, United States
Duration: Sep 24 2008Sep 26 2008

Other

Other46th Annual Allerton Conference on Communication, Control, and Computing
CountryUnited States
CityMonticello, IL
Period9/24/089/26/08

Fingerprint

Error correction
Parallel algorithms

Keywords

  • Bit flipping algorithms
  • Error correction capability
  • Gallager a algorithm
  • Low-density parity-check codes

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Control and Systems Engineering
  • Communication

Cite this

Chilappagari, S. K., Nguyen, D. V., Vasic, B. V., & Marcellin, M. W. (2008). Girth of the tanner graph and error correction capability of LDPC codes. In 46th Annual Allerton Conference on Communication, Control, and Computing (pp. 1238-1245). [4797702] https://doi.org/10.1109/ALLERTON.2008.4797702

Girth of the tanner graph and error correction capability of LDPC codes. / Chilappagari, Shashi Kiran; Nguyen, Dung Viet; Vasic, Bane V; Marcellin, Michael W.

46th Annual Allerton Conference on Communication, Control, and Computing. 2008. p. 1238-1245 4797702.

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

Chilappagari, SK, Nguyen, DV, Vasic, BV & Marcellin, MW 2008, Girth of the tanner graph and error correction capability of LDPC codes. in 46th Annual Allerton Conference on Communication, Control, and Computing., 4797702, pp. 1238-1245, 46th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, United States, 9/24/08. https://doi.org/10.1109/ALLERTON.2008.4797702
Chilappagari SK, Nguyen DV, Vasic BV, Marcellin MW. Girth of the tanner graph and error correction capability of LDPC codes. In 46th Annual Allerton Conference on Communication, Control, and Computing. 2008. p. 1238-1245. 4797702 https://doi.org/10.1109/ALLERTON.2008.4797702
Chilappagari, Shashi Kiran ; Nguyen, Dung Viet ; Vasic, Bane V ; Marcellin, Michael W. / Girth of the tanner graph and error correction capability of LDPC codes. 46th Annual Allerton Conference on Communication, Control, and Computing. 2008. pp. 1238-1245
@inproceedings{37364e7267f14916838e04bb29a97516,
title = "Girth of the tanner graph and error correction capability of LDPC codes",
abstract = "We investigate the relation between the girth and the guaranteed error correction capability of γ-left regular LDPC codes. For column-weight-three codes, we give upper and lower bounds on the number of errors correctable by the Gallager A algorithm. For higher column weight codes, we find the number of variable nodes which are guaranteed to expand by a factor of at least 3γ/4, hence giving a lower bound on the guaranteed correction capability under the bit flipping (serial and parallel) algorithms. We also establish upper bounds by studying the sizes of smallest possible trapping sets.",
keywords = "Bit flipping algorithms, Error correction capability, Gallager a algorithm, Low-density parity-check codes",
author = "Chilappagari, {Shashi Kiran} and Nguyen, {Dung Viet} and Vasic, {Bane V} and Marcellin, {Michael W}",
year = "2008",
doi = "10.1109/ALLERTON.2008.4797702",
language = "English (US)",
isbn = "9781424429264",
pages = "1238--1245",
booktitle = "46th Annual Allerton Conference on Communication, Control, and Computing",

}

TY - GEN

T1 - Girth of the tanner graph and error correction capability of LDPC codes

AU - Chilappagari, Shashi Kiran

AU - Nguyen, Dung Viet

AU - Vasic, Bane V

AU - Marcellin, Michael W

PY - 2008

Y1 - 2008

N2 - We investigate the relation between the girth and the guaranteed error correction capability of γ-left regular LDPC codes. For column-weight-three codes, we give upper and lower bounds on the number of errors correctable by the Gallager A algorithm. For higher column weight codes, we find the number of variable nodes which are guaranteed to expand by a factor of at least 3γ/4, hence giving a lower bound on the guaranteed correction capability under the bit flipping (serial and parallel) algorithms. We also establish upper bounds by studying the sizes of smallest possible trapping sets.

AB - We investigate the relation between the girth and the guaranteed error correction capability of γ-left regular LDPC codes. For column-weight-three codes, we give upper and lower bounds on the number of errors correctable by the Gallager A algorithm. For higher column weight codes, we find the number of variable nodes which are guaranteed to expand by a factor of at least 3γ/4, hence giving a lower bound on the guaranteed correction capability under the bit flipping (serial and parallel) algorithms. We also establish upper bounds by studying the sizes of smallest possible trapping sets.

KW - Bit flipping algorithms

KW - Error correction capability

KW - Gallager a algorithm

KW - Low-density parity-check codes

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

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

U2 - 10.1109/ALLERTON.2008.4797702

DO - 10.1109/ALLERTON.2008.4797702

M3 - Conference contribution

SN - 9781424429264

SP - 1238

EP - 1245

BT - 46th Annual Allerton Conference on Communication, Control, and Computing

ER -