Trapping sets in irregular LDPC code ensembles

Olgica Milenkovic; Emina Soljanin; Philip Whiting

doi:10.1109/ICC.2006.254894

Trapping sets in irregular LDPC code ensembles

Olgica Milenkovic^*, Emina Soljanin, Philip Whiting

^*Corresponding author for this work

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

7 Citations (Scopus)

Abstract

Trapping sets represent 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. We compute the asymptotic normalized distributions of trapping sets in random, irregular, binary low-density parity-check (LDPC) code ensembles. Our derivations rely on techniques from large deviation theory and statistical methods for enumerating random-like matrices. Similar methods can be used for computing the spectra of other combinatorial entities in LDPC code, such as subcodes and/or minimal codewords.

Original language	English
Title of host publication	2006 IEEE International Conference on Communications, ICC 2006
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	1101-1106
Number of pages	6
Volume	3
ISBN (Print)	1424403553, 9781424403554
DOIs	https://doi.org/10.1109/ICC.2006.254894
Publication status	Published - 2006
Externally published	Yes
Event	2006 IEEE International Conference on Communications, ICC - 2006 - Istanbul, Turkey Duration: 11 Jul 2006 → 15 Jul 2006

Other

Other	2006 IEEE International Conference on Communications, ICC - 2006
Country/Territory	Turkey
City	Istanbul
Period	11/07/06 → 15/07/06

Access to Document

10.1109/ICC.2006.254894

Cite this

@inproceedings{b7c34a68209f4ca5994b32bc52c725c4,

title = "Trapping sets in irregular LDPC code ensembles",

abstract = "Trapping sets represent 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. We compute the asymptotic normalized distributions of trapping sets in random, irregular, binary low-density parity-check (LDPC) code ensembles. Our derivations rely on techniques from large deviation theory and statistical methods for enumerating random-like matrices. Similar methods can be used for computing the spectra of other combinatorial entities in LDPC code, such as subcodes and/or minimal codewords.",

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

year = "2006",

doi = "10.1109/ICC.2006.254894",

language = "English",

isbn = "1424403553",

volume = "3",

pages = "1101--1106",

booktitle = "2006 IEEE International Conference on Communications, ICC 2006",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "2006 IEEE International Conference on Communications, ICC - 2006 ; Conference date: 11-07-2006 Through 15-07-2006",

}

Milenkovic, O, Soljanin, E & Whiting, P 2006, Trapping sets in irregular LDPC code ensembles. in 2006 IEEE International Conference on Communications, ICC 2006. vol. 3, 4024286, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 1101-1106, 2006 IEEE International Conference on Communications, ICC - 2006, Istanbul, Turkey, 11/07/06. https://doi.org/10.1109/ICC.2006.254894

Trapping sets in irregular LDPC code ensembles. / Milenkovic, Olgica; Soljanin, Emina; Whiting, Philip.
2006 IEEE International Conference on Communications, ICC 2006. Vol. 3 Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2006. p. 1101-1106 4024286.

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

TY - GEN

T1 - Trapping sets in irregular LDPC code ensembles

AU - Milenkovic, Olgica

AU - Soljanin, Emina

AU - Whiting, Philip

PY - 2006

Y1 - 2006

N2 - Trapping sets represent 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. We compute the asymptotic normalized distributions of trapping sets in random, irregular, binary low-density parity-check (LDPC) code ensembles. Our derivations rely on techniques from large deviation theory and statistical methods for enumerating random-like matrices. Similar methods can be used for computing the spectra of other combinatorial entities in LDPC code, such as subcodes and/or minimal codewords.

AB - Trapping sets represent 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. We compute the asymptotic normalized distributions of trapping sets in random, irregular, binary low-density parity-check (LDPC) code ensembles. Our derivations rely on techniques from large deviation theory and statistical methods for enumerating random-like matrices. Similar methods can be used for computing the spectra of other combinatorial entities in LDPC code, such as subcodes and/or minimal codewords.

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

U2 - 10.1109/ICC.2006.254894

DO - 10.1109/ICC.2006.254894

M3 - Conference proceeding contribution

AN - SCOPUS:33845569953

SN - 1424403553

SN - 9781424403554

VL - 3

SP - 1101

EP - 1106

BT - 2006 IEEE International Conference on Communications, ICC 2006

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

T2 - 2006 IEEE International Conference on Communications, ICC - 2006

Y2 - 11 July 2006 through 15 July 2006

ER -

Trapping sets in irregular LDPC code ensembles

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this