Quantum error-correction codes are immeasurable resources for quantum computing and quantum communication.However,the existing decoders are generally incapable of checking node duplication of belief propagation(BP)on ...Quantum error-correction codes are immeasurable resources for quantum computing and quantum communication.However,the existing decoders are generally incapable of checking node duplication of belief propagation(BP)on quantum low-density parity check(QLDPC)codes.Based on the probability theory in the machine learning,mathematical statistics and topological structure,a GF(4)(the Galois field is abbreviated as GF)augmented model BP decoder with Tanner graph is designed.The problem of repeated check nodes can be solved by this decoder.In simulation,when the random perturbation strength p=0.0115-0.0116 and number of attempts N=60-70,the highest decoding efficiency of the augmented model BP decoder is obtained,and the low-loss frame error rate(FER)decreases to 7.1975×10^(-5).Hence,we design a novel augmented model decoder to compare the relationship between GF(2)and GF(4)for quantum code[[450,200]]on the depolarization channel.It can be verified that the proposed decoder provides the widely application range,and the decoding performance is better in QLDPC codes.展开更多
The girth plays an important role in the design of LDPC codes. In order to determine the girth of Tanner(5,7) quasi-cyclic( QC) LDPC codes with length 7p for p being a prime with the form 35 m + 1,the cycles of length...The girth plays an important role in the design of LDPC codes. In order to determine the girth of Tanner(5,7) quasi-cyclic( QC) LDPC codes with length 7p for p being a prime with the form 35 m + 1,the cycles of lengths 4,6,8,and 10 are analyzed. Then these cycles are classified into sixteen categories,each of which can be expressed as an ordered block sequence,or a certain type. It is also shown that the existence of these cycles is equal to polynomial equations over Fpwho has a 35th unit root. We check if these polynomial equations have a 35th unit root and obtain the girth values of Tanner(5,7) QC LDPC codes.展开更多
In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destinatio...In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destination which is in accordance with the corresponding joint Tanner graph characterizing two different component LDPC codes used by the source and relay in ideal and non-ideal relay cooperations. The theoretical analysis and simulations show that the coded cooperation scheme obviously outperforms the coded non-cooperation one under the same code rate and decoding complex. The significant performance improvement can be virtually credited to the additional mutual exchange of the extrinsic information resulted by the LDPC code employed by the source and its counterpart used by the relay in both ideal and non-ideal cooperations.展开更多
为了高效地译码,需要构造没有短环的LDLC(Low Density Lattice Codes)校验矩阵。应用一种基于子集矩阵的方法,在子集矩阵中去除4环及6环,然后结合Tanner图,得到需要的校验矩阵。利用子集矩阵,计算复杂度与码长无关并且没有新的短环生成...为了高效地译码,需要构造没有短环的LDLC(Low Density Lattice Codes)校验矩阵。应用一种基于子集矩阵的方法,在子集矩阵中去除4环及6环,然后结合Tanner图,得到需要的校验矩阵。利用子集矩阵,计算复杂度与码长无关并且没有新的短环生成,使用该方法可以灵活地构造各种码长的LDLC码。仿真结果表明,在高斯白噪声信道下,与只去除了4环的LDLC码相比,应用该方法去除了6环以后,译码性能具有较大提高。展开更多
基金the National Natural Science Foundation of China(Grant Nos.11975132 and 61772295)the Natural Science Foundation of Shandong Province,China(Grant No.ZR2019YQ01)the Higher Education Science and Technology Program of Shandong Province,China(Grant No.J18KZ012).
文摘Quantum error-correction codes are immeasurable resources for quantum computing and quantum communication.However,the existing decoders are generally incapable of checking node duplication of belief propagation(BP)on quantum low-density parity check(QLDPC)codes.Based on the probability theory in the machine learning,mathematical statistics and topological structure,a GF(4)(the Galois field is abbreviated as GF)augmented model BP decoder with Tanner graph is designed.The problem of repeated check nodes can be solved by this decoder.In simulation,when the random perturbation strength p=0.0115-0.0116 and number of attempts N=60-70,the highest decoding efficiency of the augmented model BP decoder is obtained,and the low-loss frame error rate(FER)decreases to 7.1975×10^(-5).Hence,we design a novel augmented model decoder to compare the relationship between GF(2)and GF(4)for quantum code[[450,200]]on the depolarization channel.It can be verified that the proposed decoder provides the widely application range,and the decoding performance is better in QLDPC codes.
基金Sponsored by the National Natural Science Foundation of China(Grant Nos.61372074 and 91438101)the National High Technology Research and Development Program of China(Grant No.2015AA01A709)
文摘The girth plays an important role in the design of LDPC codes. In order to determine the girth of Tanner(5,7) quasi-cyclic( QC) LDPC codes with length 7p for p being a prime with the form 35 m + 1,the cycles of lengths 4,6,8,and 10 are analyzed. Then these cycles are classified into sixteen categories,each of which can be expressed as an ordered block sequence,or a certain type. It is also shown that the existence of these cycles is equal to polynomial equations over Fpwho has a 35th unit root. We check if these polynomial equations have a 35th unit root and obtain the girth values of Tanner(5,7) QC LDPC codes.
基金Supported by the Open Research Fund of National Moblie Communications Research Laboratory of Southeast Uni-versity (No. W200704)
文摘In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destination which is in accordance with the corresponding joint Tanner graph characterizing two different component LDPC codes used by the source and relay in ideal and non-ideal relay cooperations. The theoretical analysis and simulations show that the coded cooperation scheme obviously outperforms the coded non-cooperation one under the same code rate and decoding complex. The significant performance improvement can be virtually credited to the additional mutual exchange of the extrinsic information resulted by the LDPC code employed by the source and its counterpart used by the relay in both ideal and non-ideal cooperations.
文摘为了高效地译码,需要构造没有短环的LDLC(Low Density Lattice Codes)校验矩阵。应用一种基于子集矩阵的方法,在子集矩阵中去除4环及6环,然后结合Tanner图,得到需要的校验矩阵。利用子集矩阵,计算复杂度与码长无关并且没有新的短环生成,使用该方法可以灵活地构造各种码长的LDLC码。仿真结果表明,在高斯白噪声信道下,与只去除了4环的LDLC码相比,应用该方法去除了6环以后,译码性能具有较大提高。