Terminated LDPC Convolutional Codes with Thresholds Close to Capacity

Details Terminated LDPC Convolutional Codes with Thresholds Close to Capacity Terminated LDPC Convolutional Codes with Thresholds Close to Capacity

2005-08-03

arxiv.org/abs/cs/0508030v1

Computer Science

Information Theory

To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-

Scientific paper

An ensemble of LDPC convolutional codes with parity-check matrices composed of permutation matrices is considered. The convergence of the iterative belief propagation based decoder for terminated convolutional codes in the ensemble is analyzed for binary-input output-symmetric memoryless channels using density evolution techniques. We observe that the structured irregularity in the Tanner graph of the codes leads to significantly better thresholds when compared to corresponding LDPC block codes.

Affiliated with

Also associated with

No associations

Rating

Terminated LDPC Convolutional Codes with Thresholds Close to Capacity 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 Terminated LDPC Convolutional Codes with Thresholds Close to Capacity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Terminated LDPC Convolutional Codes with Thresholds Close to Capacity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-614141