A new construction method of QC-LDPC codes with low error floor based on EETS and Zig-Zag

Aiming at the problem that quasi-cyclic low density parity check (QC-LDPC) codes may have the error floor in the high signal to noise ratio (SNR) region, a new construction method of the QC-LDPC codes with the low error floor is proposed. The basic matrix of the method is based on the progressive edge growth (PEG) algorithm and the improved eliminate elementary trapping sets (EETS) algorithm so as to eliminate the elementary trapping sets in the basic matrix, then the Zig-Zag method is used to construct the cyclic shift matrix which is used to extend the basic matrix in order to construct the parity check matrix. The method not only can improve the error floor in the high SNR region, but also can flexibly design the code length and code rate. The simulation results show that at the bit error rate of 10−6, the PEG-trapping-Zig-Zag (PTZZ)-QC-LDPC(3024,1512) codes with the code rate of 0.5, compared with the PEG-Zig-Zag (PZZ)-QC-LDPC(3024,1512) codes and the PEG-QC-LDPC(3024,1512) codes, can respectively improve the net coding gain of 0.1 dB and 0.16 dB. The difference among the bit error rate performance curves will become better with the increase of the SNR. In addition, the PTZZ-QC-LDPC(3024,1512) codes have no error floor above the SNR of 2.2 dB.

[1]  Nan Zhang,et al.  Bilayer expurgated LDPC codes with uncoded relaying , 2017 .

[2]  Jaekyun Moon,et al.  Breaking the Trapping Sets in LDPC Codes: Check Node Removal and Collaborative Decoding , 2016, IEEE Transactions on Communications.

[3]  Amir H. Banihashemi,et al.  Lower Bounds on the Size of Smallest Elementary and Non-Elementary Trapping Sets in Variable-Regular LDPC Codes , 2017, IEEE Communications Letters.

[4]  Xue Chen,et al.  Construction of irregular QC LDPC codes with low error floor for high speed optical communications , 2016, 2016 Conference on Lasers and Electro-Optics (CLEO).

[5]  Amir H. Banihashemi,et al.  An efficient algorithm for finding dominant trapping sets of LDPC codes , 2011, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[6]  Sina Vafi,et al.  Combinatorial design-based Quasi-cyclic LDPC codes with girth eight , 2018 .

[7]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[8]  Amir H. Banihashemi,et al.  A PEG Construction of Finite-Length LDPC Codes with Low Error Floor , 2012, IEEE Communications Letters.

[9]  Jong-Seon No,et al.  A new two-stage decoding scheme with unreliable path search to lower the error-floor for low-density parity-check codes , 2017, IET Commun..

[10]  Lingjun Kong,et al.  Construction of Irregular QC-LDPC Codes via Masking with ACE Optimization , 2014, IEEE Communications Letters.