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 proceedingConference proceeding contribution

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 languageEnglish
Title of host publication2006 IEEE International Conference on Communications, ICC 2006
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1101-1106
Number of pages6
Volume3
ISBN (Print)1424403553, 9781424403554
DOIs
Publication statusPublished - 2006
Externally publishedYes
Event2006 IEEE International Conference on Communications, ICC - 2006 - Istanbul, Turkey
Duration: 11 Jul 200615 Jul 2006

Other

Other2006 IEEE International Conference on Communications, ICC - 2006
CountryTurkey
CityIstanbul
Period11/07/0615/07/06

Fingerprint Dive into the research topics of 'Trapping sets in irregular LDPC code ensembles'. Together they form a unique fingerprint.

Cite this