Terminated LDPC Convolutional Codes with Thresholds Close to Capacity
Information Theory
2016-11-17 v1 math.IT
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 codes.
Cite
@article{arxiv.cs/0508030,
title = {Terminated LDPC Convolutional Codes with Thresholds Close to Capacity},
author = {Michael Lentmaier and Arvind Sridharan and Kamil Sh. Zigangirov and Daniel J. Costello},
journal= {arXiv preprint arXiv:cs/0508030},
year = {2016}
}
Comments
To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005