Terminated LDPC Convolutional Codes with Thresholds Close to Capacity
Michael Lentmaier, Arvind Sridharan, Kamil Sh. Zigangirov, Daniel J. Costello
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.
Create a lesson
Related papers
Distributed Consensus, Optimization, and Learning under Communication Constraints
Zheng Chen, Nicolò Michelusi, Themistoklis Charalambous et al.
Energy-Accumulate-Then-Act Backscatter Communications With Retransmission Under Imperfect Feedback Detection
Rui Xu, Yinghui Ye, Guangyue Lu et al.
The Exact Memory-Rate Tradeoff for Three-User Secure Coded Caching
Han Fang, Nan Liu, Wei Kang
Cross-Modal Semantic Successive Refinement for Generative Image Communication over Underwater Acoustic Channels
Xu Pei, Bin Wang, Guangxu Zhu et al.
Fano's Inequality and Channel Capacity in the Individual-Sequence Regime
Neri Merhav
Exact Transport-Information Correspondence for Distribution-Adaptive Discretization
Koretaka Yuge