Scaling Behavior of Convolutional LDPC Ensembles over the BEC

Details Scaling Behavior of Convolutional LDPC Ensembles over the BEC Scaling Behavior of Convolutional LDPC Ensembles over the BEC

2011-07-12

arxiv.org/abs/1107.2229v1

Computer Science

Information Theory

Scientific paper

We study the scaling behavior of coupled sparse graph codes over the binary erasure channel. In particular, let 2L+1 be the length of the coupled chain, let M be the number of variables in each of the 2L + 1 local copies, let l be the number of iterations, let Pb denote the bit error probability, and let {\epsilon} denote the channel parameter. We are interested in how these quantities scale when we let the blocklength (2L + 1)M tend to infinity. Based on empirical evidence we show that the threshold saturation phenomenon is rather stable with respect to the scaling of the various parameters and we formulate some general rules of thumb which can serve as a guide for the design of coding systems based on coupled graphs.

Affiliated with

Also associated with

No associations

Rating

Scaling Behavior of Convolutional LDPC Ensembles over the BEC 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 Scaling Behavior of Convolutional LDPC Ensembles over the BEC, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scaling Behavior of Convolutional LDPC Ensembles over the BEC will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-565257