Capacity-Approaching Protograph Codes
Capacity-Approaching Protograph Codes
复制标题
DOI：
10.1109/jsac.2009.090806
复制
发表时间：
2009-08-01
影响因子：
16.4
通讯作者：
Andrews, Kenneth
中科院分区：
文献类型：
--
作者：
Divsalar, Dariush;Dolinar, Sam;Andrews, Kenneth
本文讨论了基于原模图的低密度奇偶校验（LDPC）码的构造。重点放在其典型最小距离随分组长度线性增长的原模图集上。提供了关于重量枚举和迭代译码阈值确定的渐近性能分析，并将其应用于一系列的码构造。通过实例介绍了既能产生低阈值又能使最小距离线性增长的构造技术。本文还从二部图上置信传播的基本原理出发，研究了高吞吐量译码的实现策略。
This paper discusses construction of protograph-based low-density parity-check (LDPC) codes. Emphasis is placed on protograph ensembles whose typical minimum distance grows linearly with block size. Asymptotic performance analysis for both weight enumeration and iterative decoding threshold determination is provided and applied to a series of code constructions. Construction techniques that yield both low thresholds and linear minimum distance growth are introduced by way of example throughout. The paper also examines implementation strategies for high throughput decoding derived from first principles of belief propagation on bipartite graphs.