Regular and irregular progressive edge-growth tanner graphs
Regular and irregular progressive edge-growth tanner graphs
复制标题
DOI：
10.1109/tit.2004.839541
复制
发表时间：
2005-01-01
影响因子：
2.5
通讯作者：
Arnold, DM
中科院分区：
文献类型：
--
作者：
Hu, XY;Eleftheriou, E;Arnold, DM
我们提出了一种通过在符号节点和校验节点之间逐边建立边或连接来构建大周长坦纳图的通用方法，称为渐进边增长（PEG）算法。根据图的参数推导出了 PEG Tanner 图的周长下限和由此产生的低密度奇偶校验 (LDPC) 码的最小距离下限。PEG 算法的简单变化也可用于生成线性时间可编码 LDPC 码。研究了使用 PEG Tanner 图并允许符号节点取值于 GF(q) (q > 2) 的规则和不规则 LDPC 码。仿真结果表明，PEG 算法是一种生成良好短块长 LDPC 码的强大算法。
We propose a general method for constructing Tanner graphs having a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner, called progressive edge-growth (PEG) algorithm. Lower bounds on the girth of PEG Tanner graphs and on the minimum distance of the resulting low-density parity-check (LDPC) codes are derived in terms of parameters of the graphs. Simple variations of the PEG algorithm can also be applied to generate linear-time encodeable LDPC codes. Regular and irregular LDPC codes using PEG Tanner graphs and allowing symbol nodes to take values over GF(q) (q > 2) are investigated. Simulation results show that the PEG algorithm is a powerful algorithm to generate good short-block-length LDPC codes.