Iterative Decoding Threshold Analysis for LDPC Convolutional Codes
ÌÇÐÄlogo Transactions on Information Theory,
October 2010
Abstract
An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavior of an iterative belief propagation decoder is analyzed for the binary erasure channel and the AWGN channel with binary inputs. It is shown that for a terminated LDPCC code ensemble, the thresholds are better than for corresponding regular and irregular LDPC block codes.