北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2009, Vol. 32 ›› Issue (6): 93-96.doi: 10.13190/jbupt.200906.93.chench

• 研究报告 • 上一篇    下一篇

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

陈超;白宝明;王新梅   

  1. (西安电子科技大学 综合业务网理论及关键技术国家重点实验室, 西安 710071)
  • 收稿日期:2009-02-15 修回日期:2009-09-28 出版日期:2009-12-28 发布日期:2009-12-28
  • 通讯作者: 陈超

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

CHEN Chao;BAI Bao-ming;WANG Xin-mei   

  1. (State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, China)
  • Received:2009-02-15 Revised:2009-09-28 Online:2009-12-28 Published:2009-12-28
  • Contact: CHEN Chao

摘要:

为了实现有效编码,提出一类可以利用Richardson-Urbanke算法的非二元准循环低密度校验码(QC-LDPC)码. 校验矩阵的右侧部分列重均为2,可用来构造规则和非规则码. 对校验矩阵的约束保证了这类码具有线性编码复杂度. 仿真结果表明,所提出的码和高阶调制结合,其性能优于渐进边增长(PEG)构造的码,并可获得接近Shannon限的性能.

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

Abstract:

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.

Key words: low-density parity-check codes, nonbinary, quasi-cyclic, Richardson-Urbanke algorithm, spectral efficiency, Shannon limit