Asymptotic distributions of trapping sets in random regular LDPC code ensembles

Olgica Milenkovic; Emina Soljanin; Philip Whiting

Asymptotic distributions of trapping sets in random regular LDPC code ensembles

Olgica Milenkovic, Emina Soljanin, Philip Whiting

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

Abstract

We address the problem of evaluating the asymptotic normalized distributions of a class of combinatorial configurations in random, regular, binary low-density parity-check (LDPC) code ensembles. Among the configurations considered are trapping and stopping sets1; these sets represent induced subgraphs in the Tanner graph of a code that, for certain classes of channels, exhibit a strong influence on the height and point of onset of the error-floor. The techniques used in the derivations are based on large deviation theory and statistical methods for enumerating random-like matrices. These techniques can also be applied in a setting that involves more general structural entities such as subcodes and/or minimal codewords, which are known to characterize other important properties of soft-decision decoders of linear codes.

Original language	English
Title of host publication	43rd Annual Allerton Conference on Communication, Control and Computing 2005
Subtitle of host publication	proceedings
Place of Publication	Champaign, IL
Publisher	University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages	1737-1746
Number of pages	10
Volume	4
ISBN (Electronic)	9781604234916
Publication status	Published - 2005
Externally published	Yes
Event	43rd Annual Allerton Conference on Communication, Control and Computing 2005 - Monticello, United States Duration: 28 Sept 2005 → 30 Sept 2005

Other

Other	43rd Annual Allerton Conference on Communication, Control and Computing 2005
Country/Territory	United States
City	Monticello
Period	28/09/05 → 30/09/05

Cite this

Milenkovic, O., Soljanin, E., & Whiting, P. (2005). Asymptotic distributions of trapping sets in random regular LDPC code ensembles. In 43rd Annual Allerton Conference on Communication, Control and Computing 2005: proceedings (Vol. 4, pp. 1737-1746). University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering.

Milenkovic, Olgica ; Soljanin, Emina ; Whiting, Philip. / Asymptotic distributions of trapping sets in random regular LDPC code ensembles. 43rd Annual Allerton Conference on Communication, Control and Computing 2005: proceedings. Vol. 4 Champaign, IL : University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2005. pp. 1737-1746

@inproceedings{ed5fbcd47db34b8eba85b1c9dc88e811,

title = "Asymptotic distributions of trapping sets in random regular LDPC code ensembles",

abstract = "We address the problem of evaluating the asymptotic normalized distributions of a class of combinatorial configurations in random, regular, binary low-density parity-check (LDPC) code ensembles. Among the configurations considered are trapping and stopping sets1; these sets represent induced subgraphs in the Tanner graph of a code that, for certain classes of channels, exhibit a strong influence on the height and point of onset of the error-floor. The techniques used in the derivations are based on large deviation theory and statistical methods for enumerating random-like matrices. These techniques can also be applied in a setting that involves more general structural entities such as subcodes and/or minimal codewords, which are known to characterize other important properties of soft-decision decoders of linear codes.",

author = "Olgica Milenkovic and Emina Soljanin and Philip Whiting",

year = "2005",

language = "English",

volume = "4",

pages = "1737--1746",

booktitle = "43rd Annual Allerton Conference on Communication, Control and Computing 2005",

publisher = "University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering",

address = "United States",

note = "43rd Annual Allerton Conference on Communication, Control and Computing 2005 ; Conference date: 28-09-2005 Through 30-09-2005",

}

Milenkovic, O, Soljanin, E & Whiting, P 2005, Asymptotic distributions of trapping sets in random regular LDPC code ensembles. in 43rd Annual Allerton Conference on Communication, Control and Computing 2005: proceedings. vol. 4, University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, Champaign, IL, pp. 1737-1746, 43rd Annual Allerton Conference on Communication, Control and Computing 2005, Monticello, United States, 28/09/05.

Asymptotic distributions of trapping sets in random regular LDPC code ensembles. / Milenkovic, Olgica; Soljanin, Emina; Whiting, Philip.
43rd Annual Allerton Conference on Communication, Control and Computing 2005: proceedings. Vol. 4 Champaign, IL: University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2005. p. 1737-1746.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Asymptotic distributions of trapping sets in random regular LDPC code ensembles

AU - Milenkovic, Olgica

AU - Soljanin, Emina

AU - Whiting, Philip

PY - 2005

Y1 - 2005

N2 - We address the problem of evaluating the asymptotic normalized distributions of a class of combinatorial configurations in random, regular, binary low-density parity-check (LDPC) code ensembles. Among the configurations considered are trapping and stopping sets1; these sets represent induced subgraphs in the Tanner graph of a code that, for certain classes of channels, exhibit a strong influence on the height and point of onset of the error-floor. The techniques used in the derivations are based on large deviation theory and statistical methods for enumerating random-like matrices. These techniques can also be applied in a setting that involves more general structural entities such as subcodes and/or minimal codewords, which are known to characterize other important properties of soft-decision decoders of linear codes.

AB - We address the problem of evaluating the asymptotic normalized distributions of a class of combinatorial configurations in random, regular, binary low-density parity-check (LDPC) code ensembles. Among the configurations considered are trapping and stopping sets1; these sets represent induced subgraphs in the Tanner graph of a code that, for certain classes of channels, exhibit a strong influence on the height and point of onset of the error-floor. The techniques used in the derivations are based on large deviation theory and statistical methods for enumerating random-like matrices. These techniques can also be applied in a setting that involves more general structural entities such as subcodes and/or minimal codewords, which are known to characterize other important properties of soft-decision decoders of linear codes.

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

M3 - Conference proceeding contribution

AN - SCOPUS:84961899547

VL - 4

SP - 1737

EP - 1746

BT - 43rd Annual Allerton Conference on Communication, Control and Computing 2005

PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering

CY - Champaign, IL

T2 - 43rd Annual Allerton Conference on Communication, Control and Computing 2005

Y2 - 28 September 2005 through 30 September 2005

ER -

Milenkovic O, Soljanin E, Whiting P. Asymptotic distributions of trapping sets in random regular LDPC code ensembles. In 43rd Annual Allerton Conference on Communication, Control and Computing 2005: proceedings. Vol. 4. Champaign, IL: University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering. 2005. p. 1737-1746

Asymptotic distributions of trapping sets in random regular LDPC code ensembles

Abstract

Other

Other files and links

Fingerprint

Cite this