论文部分内容阅读
The existing constructions of quasi-cyclic low-density parity-check (QC-LDPC) codes do not consider the problems of small stopping sets and small girth together in the Tanner graph, while their existences will lead to the bit error rate (BER) performance of QC-LDPC codes being much poorer than that of randomly constructed LDPC codes even decoding failure. To solve the problem, some theorems of the specific chosen parity-check matrix of QC-LDPC codes without small stopping sets and small girth are proposed. A novel construction for QC-LDPC codes with long block lengths is presented by multiplying mmin or the multiple of mmin, which is the minimum order of the identity matrix for the chosen parity-check matrix. The simulation results show that the specific chosen parity-check matrix of QC-LDPC codes can effectively avoid specified stopping sets and small girth and exhibit excellent BER performance than random LDPC codes with the same longer codes length.
The existing constructions of quasi-cyclic low-density parity-check (QC-LDPC) codes do not consider the problems of small stopping sets and small girth together in the Tanner graph, while their existences will lead to the bit error rate (BER) performance of QC-LDPC codes are much poorer than that of randomly constructed LDPC codes even decoding failures. To solve the problem, some theorems of the specific chosen parity-check matrix of QC-LDPC codes without small stopping sets and small girth are proposed. A novel construction for QC-LDPC codes with long block lengths is presented by multiplying mmin or the multiple of mmin, which is the minimum order of the identity matrix for the chosen parity-check matrix. The simulation results show that the specific chosen parity- check matrix of QC-LDPC codes can effectively avoid specifying stopping performance and small girth and exhibit excellent BER performance than random LDPC codes with the same longer codes length.