Terminated LDPC Convolutional Codes with Thresholds Close to Capacity
<|reference_start|>Terminated LDPC Convolutional Codes with Thresholds Close to Capacity: 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.<|reference_end|>
@article{lentmaier2005terminated,
    title={Terminated LDPC Convolutional Codes with Thresholds Close to Capacity},
    author={Michael Lentmaier, Arvind Sridharan, Kamil Sh. Zigangirov, and Daniel
  J. Costello Jr},
    journal={arXiv preprint arXiv:cs/0508030},
    year={2005},
    doi={10.1109/ISIT.2005.1523567},
    archivePrefix={arXiv},
    eprint={cs/0508030},
    primaryClass={cs.IT math.IT}
}