原模图LDPC码的准循环扩展和编码算法  

Quasi-cyclic Expansion and Encoding Algorithms for Protograph LDPC Codes

作　　者：李忠亮[1,2] 夏国江[2,3] 

机构地区：[1]西北工业大学航天学院,西安710072 [2]北京机电工程研究所,北京100074 [3]中国科学院空间科学与应用研究中心,北京100190

出　　处：《空间科学学报》2011年第3期406-411,共6页Chinese Journal of Space Science

摘　　要：原模图LDPC码性能优异,适合高速编译码,但针对它的扩展和编码算法研究较少.利用矩阵环与多项式环的同构关系,提出了原模图LDPC码准循环扩展和生成矩阵求解的高效算法.仿真结果表明,用所提出的扩展算法得到的原模图LDPC码,在相同的最大变量节点度条件下,性能优于已知的最好无结构非正则码.Recently,a new class of Low-Density Parity-Check（LDPC）codes constructed from a templat was introduced.This kind of codes were called protograph codes.The protograph serves as a blueprint for constructing LDPC codes of arbitrary size whose performance can be predicted by analyzing the protograph.Protograph LDPC codes perform very well and suit for high-speed encoding and decoding.However,there are few researches on expansion and encoding algorithms for them.In this paper,using isomorphism between matrix ring and polynomial ring,we propose efficient quasi-cyclic expansion and encoding algorithms for protograph LDPC codes.Simulation results show that the protograph LDPC codes which were constructed by the algorithm proposed in this paper,outperform the best known unstructured irregular LDPC codes with the same maximum node degrees.

关 键 词：LDPC码 原模图 准循环扩展 环同构 

分 类 号：TN927[电子电信—通信与信息系统]