达到最小汉明距离上界的准循环GF(q)-LDPC码  

Construction of Quasi-Cyclic GF(q)-LDPC Codes Achieving the Upper Bound on the Minimum Hamming Distance

作　　者：胡树楷[1] 杨洋[1] 王新梅[1] 

机构地区：[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,西安710071

出　　处：《北京邮电大学学报》2012年第2期1-4,共4页Journal of Beijing University of Posts and Telecommunications

基　　金：国家重点基础研究发展计划项目(2010CB328300);国家自然科学基金项目(61101127)

摘　　要：为了构造在瀑布区和错误平层区都具有良好性能的多元低密度校验(LDPC)码,提出了一种提高多元准循环(QC)LDPC最小汉明距离的构造方法.针对列重为2的QC LDPC码,证明了其最小汉明距离的2个上界,并提出了一种支持线性复杂度并行编码的基矩阵设计,给出了构造原则.根据该原则构造出的QC LDPC码可达到其最小汉明距离上界,且具备并行线性编码的优点.仿真结果表明,该码在瀑布区域具有良好的性能,同时具有较好的错误平层特性.In order to construct nonbinary low-density parity-check（LDPC） codes with good waterfall and error floor properties,a method to improve the minimum Hamming distance of a class of nonbinary quasi-cyclic（QC） LDPC codes is presented.Two upper bounds on the minimum Hamming distance are derived for the nonbinary QC LDPC codes whose parity-check matrices consist of weight-2 columns.A special base matrix design allowing linear encoding in a parallel manner is also proposed.In addition,the design principals are given,according to which,the parallel and efficiently encodable codes reaching the upper bound on the minimum Hamming distance can be developed.Simulation shows that the proposed codes have both good waterfall and error floor properties.

关 键 词：低密度校验码 非二元 最小汉明距离 准循环 高效编码 

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