Systems Engineering and Electronics ›› 2018, Vol. 40 ›› Issue (11): 2586-.doi: 10.3969/j.issn.1001-506X.2018.11.28

Previous Articles     Next Articles

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

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.

[an error occurred while processing this directive]