On the dynamics of the error floor behavior in (regular) LDPC codes

Authors:
Christian Schlegel;Shuai Zhang
Affiliations:
iCORE High Capacity Digital Communications Laboratory, University of Alberta, Edmonton, AB, Canada;iCORE High Capacity Digital Communications Laboratory, University of Alberta, Edmonton, AB, Canada
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 6
Cited 2

Trellis and Turbo Coding

Trellis and Turbo Coding
Analysis of connections between pseudocodewords

IEEE Transactions on Information Theory
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes

IEEE Transactions on Information Theory
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

IEEE Transactions on Information Theory
Signal-space characterization of iterative decoding

IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel

IEEE Transactions on Information Theory

On the dynamics of analog min-sum iterative decoders: an analytical approach

IEEE Transactions on Communications
The manifestation of stopping sets and absorbing sets as deviations on the computation trees of LDPC codes

Journal of Electrical and Computer Engineering - Special issue on iterative signal processing in communications

Quantified Score

Hi-index	754.84

Visualization

Abstract

It is shown that dominant trapping sets of regular low-density parity-check (LDPC) codes, so-called absorption sets, undergo a two-phased dynamic behavior in the iterative messagepassing decoding algorithm. Using a linear dynamic model for the iteration behavior of these sets, it is shown that they undergo an initial geometric growth phase which stabilizes in a final bit-flipping behavior where the algorithm reaches a fixed point. This analysis is shown to lead to very accurate numerical calculations of the error floor bit error rates down to error rates that are inaccessible by simulation. The topology of the dominant absorption sets of an example code, the IEEE 802.3an (2048,1723) regular LDPC code, are identified and tabulated using topological relationships in combination with search algorithms.