Iterative Decoding Threshold Analysis for LDPC Convolutional Codes
Michael Lentmaier, Arvind Sridharan, Daniel J. Costello et al. · IEEE Transactions on Information Theory · 2010
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.
Cited by 407 works. doi:10.1109/tit.2010.2059490
Authors
References
- Low-density parity-check codes
- Low-Density Parity-Check Codes
- Design of capacity-approaching irregular low-density parity-check codes
- The capacity of low-density parity-check codes under message-passing decoding
- Practical loss-resilient codes
- Codes and Decoding on General Graphs
- On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
- Time-varying periodic convolutional codes with low-density parity-check matrix
- Fundamentals of Convolutional Coding
- Fundamentals of Convolutional Coding