Asymptotically Good LDPC Convolutional Codes Based on Protographs

Details Asymptotically Good LDPC Convolutional Codes Based on Protographs Asymptotically Good LDPC Convolutional Codes Based on Protographs

2008-05-02

arxiv.org/abs/0805.0241v1

Computer Science

Information Theory

Proceedings of the 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 6 - 11, 2008

Scientific paper

LDPC convolutional codes have been shown to be capable of achieving the same capacity-approaching performance as LDPC block codes with iterative message-passing decoding. In this paper, asymptotic methods are used to calculate a lower bound on the free distance for several ensembles of asymptotically good protograph-based LDPC convolutional codes. Further, we show that the free distance to constraint length ratio of the LDPC convolutional codes exceeds the minimum distance to block length ratio of corresponding LDPC block codes.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-341303