接近容量的终止 LDPC 卷积码
信息论
2016-11-17 v1 math.IT
摘要
考虑由置换矩阵组成的 LDPC 卷积码集合。使用密度演化技术对二进制输入输出对称无记忆信道下终止卷积码在迭代信念传播基于解码器的收敛性进行分析。我们观察到，Tanner 图中所呈现的结构化不规则性导致的阈值显著优于相应的 LDPC 块码。
引用
@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}
}
备注
To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005