Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles
Milenkovic, O.
Soljanin, E.
Whiting, P.
Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO
This paper appears in: Information Theory, IEEE Transactions on Publication Date: Jan. 2007
Volume: 53
,
Issue: 1
On page(s):
39
- 55
ISSN: 0018-9448
Digital Object Identifier: 10.1109/TIT.2006.887060
Current Version Published: 2006-12-26
Abstract
We evaluate the asymptotic normalized average distributions of a class of combinatorial configurations in random, regular and irregular, binary low-density parity-check (LDPC) code ensembles. Among the configurations considered are trapping and stopping sets. These sets represent subsets of variable nodes in the Tanner graph of a code that play an important role in determining the height and point of onset of the error-floor in its performance curve. The techniques used for deriving the spectra include large deviations theory and statistical methods for enumerating binary matrices with prescribed row and column sums. These techniques can also be applied in a setting that involves more general structural entities such as subcodes and/or minimal codewords, that are known to characterize other important properties of soft-decision decoders of linear block codes
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
You are not
logged in.
Guests
may access Abstract records free of charge.
Cart
