一种改进的LDPC码的PEG构造算法  

An improved PEG algorithm for construction of LDPC codes

作　　者：赵旦峰[1] 佟宁宁 吴宇平[1] 

机构地区：[1]哈尔滨工程大学信息与通信工程学院,黑龙江哈尔滨150001

出　　处：《应用科技》2008年第8期9-11,共3页Applied Science and Technology

摘　　要：PEG构造算法是迄今为止构造性能优异的中短码长LDPC码的一种有效的构造方法,然而直接采用该算法构造LDPC码的编码复杂度正比于码长的平方,使其成为实用化过程中的一个瓶颈.针对该问题,基于具有线性编码复杂度的迭代编码算法,提出了一种改进的PEG构造算法.仿真结果表明,在MSK调制情况下,虽然改进的PEG构造算法构造的LDPC码码字与PEG构造算法构造的码字的纠错性能基本一致,但是其最大的优势在于具有更低的硬件实现复杂度.Progressive-edge-growth （PEG） algorithm is much effective for constructing LDPC codes with short and intermediate block lengths. However, the complexity of the codes produced by such algorithm is directly proportional to the square of code length, which hinders the development of LDPC code ＇s implementation. To solve such a problem, this paper presents an improved PEG algorithm which can be encoded by the iterative encoding algorithm with linear coding complexity. The simulation results indicated that, for MSK modulation, the obvious advantage of the presented method is its low complexity in hardware implementation although the error-correcting capability of irregular LDPC codes constructed by the proposed methods is basically identical to that of the codes constructed by the PEG algorithm.

关 键 词：PEG算法 迭代编码 下三角结构 非规则LDPC码 

分 类 号：TN911.22[电子电信—通信与信息系统]