Terminated LDPC convolutional codes with thresholds close to capacity
Authors:
- A. SridharanASA. Sridharan
- K.SH. ZigangirovKZK.SH. Zigangirov
- D.J. CostelloDCD.J. Costello
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1372-1376
Abstract
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 codesKeywords
All Related Versions
This publication has 6 references indexed in Scilit:
- An analysis of the block error probability performance of iterative decodingIEEE Transactions on Information Theory, 2005
- LDPC Block and Convolutional Codes Based on Circulant MatricesIEEE Transactions on Information Theory, 2004
- Reduced complexity decoding strategies for LDPC convolutional codes2004
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Time-varying periodic convolutional codes with low-density parity-check matrixIEEE Transactions on Information Theory, 1999
- Low-Density Parity-Check Codes1963