Ensemble Weight Enumerators for Protograph LDPC Codes
Ensemble Weight Enumerators for Protograph LDPC Codes
复制标题
原图 LDPC 码的整体权重枚举器
DOI：
10.1109/isit.2006.262129
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
D. Divsalar
中科院分区：
文献类型：
--
作者：
D. Divsalar
近年来，人们提出了具有投影图或原型图结构的LDPC码。本文给出了具有原始结构的LDPC码的有限长度集合权枚举数。当块大小趋于无穷大时，得到渐近结果。特别是，我们对具有典型的最小距离随块大小线性增长的原始LDPC码的集成平均权重枚举器感兴趣。与不规则系统一样，线性最小距离特性对二阶变量节点的比例非常敏感。本文推导了集合权枚举数的结果，表明非结构不规则LDPC码度分布的线性最小距离条件是原始LDPC码的充分条件，但不是必要条件
Recently, LDPC codes with projected graph, or protograph structures have been proposed. In this paper, finite length ensemble weight enumerators for LDPC codes with protograph structures are obtained. Asymptotic results are derived as the block size goes to infinity. In particular, we are interested in obtaining ensemble average weight enumerators for protograph LDPC codes which have typical minimum distance that grows linearly with block size. As with irregular ensembles, linear minimum distance property is sensitive to the proportion of degree-2 variable nodes. In this paper, the derived results on ensemble weight enumerators show that linear minimum distance condition on degree distribution of unstructured irregular LDPC codes is a sufficient but not a necessary condition for protograph LDPC codes
详细表示的不规则 LDPC 码系综的渐近权重和停止集分布
DOI：
--
发表时间：
2004
期刊：
IEICE Trans. on Fundamentals E87-A. No.10
影响因子：
--
作者：
T.Shibuya;R.Ikegaya
通讯作者：
R.Ikegaya