系统工程与电子技术 ›› 2018, Vol. 40 ›› Issue (11): 2586-.doi: 10.3969/j.issn.1001-506X.2018.11.28

• 通信与网络 • 上一篇    下一篇

基于完备循环差集的type-Ⅱ QC-LDPC码的构造

黄胜, 宋静, 袁建国   

  1. 重庆邮电大学光通信及网络重点实验室, 重庆 400065
  • 出版日期:2018-10-25 发布日期:2018-11-14

Construction of the type-Ⅱ QC-LDPC codes based on perfect complete cyclic difference families

HUANG Sheng, SONG Jing, YUAN Jianguo   

  1. Key Laboratory of Optical Communication and Networks, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
  • Online:2018-10-25 Published:2018-11-14

摘要:

针对当前type-Ⅱ的准循环低密度奇偶校验(quasi-cyclic low-density parity check, QC-LDPC)码中仅含有权重为2的循环置换矩阵而引入短环,导致迭代译码性能下降的问题,基于完备循环差集给出了近似双对角结构的type-Ⅱ QC-LDPC码的设计方法,该方法构造的奇偶校验矩阵由零矩阵,权重为1的循环单位阵和权重为2的循环矩阵组成,不但围长至少为8,而且还保留了type-Ⅱ QC-LDPC码具有更高最小距离上界的优点,从而使译码时可快速收敛。仿真结果表明:构造的type-Ⅱ QC-LDPC码在加性高斯白噪声(additive white Gauss noise, AWGN)信道下,采用和积(sum-product algorithm, SPA)译码时,码字无明显的错误平层且具有良好的纠错性能。

Abstract:

To deal with the short girth, which caused by the only weight-2 circulant permutation matrices in the current type-Ⅱ quasi-cyclic low-density parity check (QC-LDPC) codes. A method of approximate double diagonal structure of the type-Ⅱ QC-LDPC codes based on perfect cyclic difference families (P-CDF) is proposed. The parity check matrices constructed by this method consist of zero matrices, weight-1 circulant permutation matrices and weight-2 permutation matrices, which not only keeps the girth at least 8, but also retains the advantages of type-Ⅱ QC-LDPC codes with a higher minimum distance upper bound, so that decoding can quickly converge. The simulation results show that the type-ⅡQC-LDPC codes have no obvious error-floor and good iterative decoding performance when decoded by the sum-product algorithm (SPA) under the additive white Gauss noise (AWGN) channel.