Asymptotic distributions of trapping sets in random regular LDPC code ensembles

Olgica Milenkovic, Emina Soljanin, Philip Whiting

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-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 languageEnglish
Title of host publication43rd Annual Allerton Conference on Communication, Control and Computing 2005
Subtitle of host publicationproceedings
Place of PublicationChampaign, IL
PublisherUniversity of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages1737-1746
Number of pages10
Volume4
ISBN (Electronic)9781604234916
Publication statusPublished - 2005
Externally publishedYes
Event43rd Annual Allerton Conference on Communication, Control and Computing 2005 - Monticello, United States
Duration: 28 Sep 200530 Sep 2005

Other

Other43rd Annual Allerton Conference on Communication, Control and Computing 2005
CountryUnited States
CityMonticello
Period28/09/0530/09/05

Fingerprint

Dive into the research topics of 'Asymptotic distributions of trapping sets in random regular LDPC code ensembles'. Together they form a unique fingerprint.

Cite this