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

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

2009-02-11

arxiv.org/abs/0902.1786v2

Computer Science

Information Theory

15 pages, submitted to IEEE Trans. Inf. Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-486960