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

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

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 (US)
Title of host publication	2006 IEEE International Conference on Communications, ICC 2006
Pages	1101-1106
Number of pages	6
DOIs	https://doi.org/10.1109/ICC.2006.254894
State	Published - Dec 1 2006
Externally published	Yes
Event	2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey Duration: Jul 11 2006 → Jul 15 2006

Publication series

Name	IEEE International Conference on Communications
Volume	3
ISSN (Print)	0536-1486

Other

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

ASJC Scopus subject areas

Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/ICC.2006.254894

Cite this

Milenkovic, O, Soljanin, E & Whiting, P 2006, Trapping sets in irregular LDPC code ensembles. in 2006 IEEE International Conference on Communications, ICC 2006., 4024286, IEEE International Conference on Communications, vol. 3, pp. 1101-1106, 2006 IEEE International Conference on Communications, ICC 2006, Istanbul, Turkey, 7/11/06. https://doi.org/10.1109/ICC.2006.254894

@inproceedings{e40ef5b4d3a64b4684332b85705ab6be,

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",

month = dec,

day = "1",

doi = "10.1109/ICC.2006.254894",

language = "English (US)",

isbn = "1424403553",

series = "IEEE International Conference on Communications",

pages = "1101--1106",

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

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

}

TY - GEN

T1 - Trapping sets in irregular LDPC code ensembles

AU - Milenkovic, Olgica

AU - Soljanin, Emina

AU - Whiting, Philip

PY - 2006/12/1

Y1 - 2006/12/1

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

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

U2 - 10.1109/ICC.2006.254894

DO - 10.1109/ICC.2006.254894

M3 - Conference contribution

AN - SCOPUS:33845569953

SN - 1424403553

SN - 9781424403554

T3 - IEEE International Conference on Communications

SP - 1101

EP - 1106

BT - 2006 IEEE International Conference on Communications, ICC 2006

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

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other links

Fingerprint

Cite this