用Richardson-Urbanke算法实现有效编码的非二元准循环LDPC码  

Nonbinary Quasi-Cyclic LDPC Codes with Efficient Richardson-Urbanke Encoding Algorithm

作　　者：陈超[1] 白宝明[1] 王新梅[1] 

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

出　　处：《北京邮电大学学报》2009年第6期93-96,共4页Journal of Beijing University of Posts and Telecommunications

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

摘　　要：为了实现有效编码,提出一类可以利用Richardson-Urbanke算法的非二元准循环低密度校验码(QC-LDPC)码.校验矩阵的右侧部分列重均为2,可用来构造规则和非规则码.对校验矩阵的约束保证了这类码具有线性编码复杂度.仿真结果表明,所提出的码和高阶调制结合,其性能优于渐进边增长(PEG)构造的码,并可获得接近Shannon限的性能.In order to implement efficient encoding, a class of nonbinary quasi-cyclic low-density parity-check （QC-LDPC） codes is proposed, which can be encoded with Richardson-Urbanke algorithm. The right part of the parity-check matrix has weight-2 columns, which allows the construction of both regular and irregular codes. Constraints on the parity-check matrix ensure a linear encoding complexity. Simulation results show that the proposed codes, when combined with higher order modulation, perform favorably with the codes constructed by the progressive-edge-growth （PEG） constructed code and close to the Shannon limits.

关 键 词：低密度校验码 非二元 准循环 Richardson-Urbanke算法 谱效率 SHANNON限 

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