In order to meet the needs of high-speed development of optical communication system, a construction method of quasi-cyclic low-density parity-check(QC-LDPC) codes based on multiplicative group of finite field is prop...In order to meet the needs of high-speed development of optical communication system, a construction method of quasi-cyclic low-density parity-check(QC-LDPC) codes based on multiplicative group of finite field is proposed. The Tanner graph of parity check matrix of the code constructed by this method has no cycle of length 4, and it can make sure that the obtained code can get a good distance property. Simulation results show that when the bit error rate(BER) is 10-6, in the same simulation environment, the net coding gain(NCG) of the proposed QC-LDPC(3 780, 3 540) code with the code rate of 93.7% in this paper is improved by 2.18 dB and 1.6 dB respectively compared with those of the RS(255, 239) code in ITU-T G.975 and the LDPC(3 2640, 3 0592) code in ITU-T G.975.1. In addition, the NCG of the proposed QC-LDPC(3 780, 3 540) code is respectively 0.2 dB and 0.4 dB higher compared with those of the SG-QC-LDPC(3 780, 3 540) code based on the two different subgroups in finite field and the AS-QC-LDPC(3 780, 3 540) code based on the two arbitrary sets of a finite field. Thus, the proposed QC-LDPC(3 780, 3 540) code in this paper can be well applied in optical communication systems.展开更多
This paper studies thee convergence properties of multiplicative iterative algorithms with inexact line search. We prove that the convergence can be guaranteed for a general form of line search rille, under the assu...This paper studies thee convergence properties of multiplicative iterative algorithms with inexact line search. We prove that the convergence can be guaranteed for a general form of line search rille, under the assumption of convexity of objective function or the assumption of convergence of the sequence generated by the algorithm. This answers an open problem put forward by lusem.展开更多
基金supported by the National Natural Science Foundation of China(No.61571072)the Basic and Advanced Technology Research Project in Chongqing(No.cstc2015jcyjA 40015)
文摘In order to meet the needs of high-speed development of optical communication system, a construction method of quasi-cyclic low-density parity-check(QC-LDPC) codes based on multiplicative group of finite field is proposed. The Tanner graph of parity check matrix of the code constructed by this method has no cycle of length 4, and it can make sure that the obtained code can get a good distance property. Simulation results show that when the bit error rate(BER) is 10-6, in the same simulation environment, the net coding gain(NCG) of the proposed QC-LDPC(3 780, 3 540) code with the code rate of 93.7% in this paper is improved by 2.18 dB and 1.6 dB respectively compared with those of the RS(255, 239) code in ITU-T G.975 and the LDPC(3 2640, 3 0592) code in ITU-T G.975.1. In addition, the NCG of the proposed QC-LDPC(3 780, 3 540) code is respectively 0.2 dB and 0.4 dB higher compared with those of the SG-QC-LDPC(3 780, 3 540) code based on the two different subgroups in finite field and the AS-QC-LDPC(3 780, 3 540) code based on the two arbitrary sets of a finite field. Thus, the proposed QC-LDPC(3 780, 3 540) code in this paper can be well applied in optical communication systems.
文摘This paper studies thee convergence properties of multiplicative iterative algorithms with inexact line search. We prove that the convergence can be guaranteed for a general form of line search rille, under the assumption of convexity of objective function or the assumption of convergence of the sequence generated by the algorithm. This answers an open problem put forward by lusem.
