On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes

DOI10.1109/TIT.2010.2048448zbMATH Open1366.94614arXiv0902.1786OpenAlexW2114074598MaRDI QIDQ5281393FDOQ5281393

Authors: Christian B. Schlegel, Shuai Zhang 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: It is shown that dominant trapping sets of regular LDPC codes, so called absorption sets, undergo a two-phased dynamic behavior in the iterative message-passing 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.

Full work available at URL: https://arxiv.org/abs/0902.1786

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05)

Cited In (7)

• LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
• STUDY OF BIFURCATION BEHAVIOR OF LDPC DECODERS
• Analytical Solution of Covariance Evolution for Irregular LDPC Codes
• Title not available (Why is that?)
• LDPC codes from cubic semisymmetric graphs
• A study of error floor behavior in QC-MDPC codes
• On the error-correcting capability of LDPC codes

This page was built for publication: On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281393)