AWGN Channel Analysis of Terminated LDPC Convolutional Codes

Details AWGN Channel Analysis of Terminated LDPC Convolutional Codes AWGN Channel Analysis of Terminated LDPC Convolutional Codes

2011-02-18

arxiv.org/abs/1102.3936v1

Computer Science

Information Theory

Presented at the 2011 Information Theory and Applications Workshop

Scientific paper

It has previously been shown that ensembles of terminated protograph-based low-density parity-check (LDPC) convolutional codes have a typical minimum distance that grows linearly with block length and that they are capable of achieving capacity approaching iterative decoding thresholds on the binary erasure channel (BEC). In this paper, we review a recent result that the dramatic threshold improvement obtained by terminating LDPC convolutional codes extends to the additive white Gaussian noise (AWGN) channel. Also, using a (3,6)-regular protograph-based LDPC convolutional code ensemble as an example, we perform an asymptotic trapping set analysis of terminated LDPC convolutional code ensembles. In addition to capacity approaching iterative decoding thresholds and linearly growing minimum distance, we find that the smallest non-empty trapping set of a terminated ensemble grows linearly with block length.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-159162