The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number

Details The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number

2008-01-07

arxiv.org/abs/0801.0931v2

Computer Science

Information Theory

5 pages, 6 figures, correcting errors in Theorem 1 and poor English

Scientific paper

We consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) code and belief propagation (BP) decoding. The bit error probability for infinite block length is known by density evolution and it is well known that a difference between the bit error probability at finite iteration number for finite block length $n$ and for infinite block length is asymptotically $\alpha/n$, where $\alpha$ is a specific constant depending on the degree distribution, the iteration number and the erasure probability. Our main result is to derive an efficient algorithm for calculating $\alpha$ for regular ensembles. The approximation using $\alpha$ is accurate for $(2,r)$-regular ensembles even in small block length.

Affiliated with

Also associated with

No associations

Rating

The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number 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 The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-653814