光通信系统中基于伽罗华域乘群的QC-LDPC码的一种新颖构造方法

基于Galois域GF(q)乘群,提出了一种构造简单且编码容易实现的新颖准循环低密度奇偶校验(QC-LDPC)码构造方法,可灵活地调整码长、码率,且编译码复杂度低。用本文方法构造了适用于光通信系统的非规则QC-LDPC(3843,3603)码,仿真表明,与已广泛用于光通信系统中的经典RS(255,239)码相比,用本文方法构造的码具有更好的纠错性能,且其性能优于用SCG方法构造的LDPC码和规则的QC-LDPC(4221,3956)码,适合用于高速长距离光通信系统。     

A novel construction method of QC-LDPC codes based on the subgroup of the finite field multiplicative group for optical transmission systems

According to the requirements of the increasing development for optical transmission systems, a novel construction method of quasi-cyclic low-density parity-check (QC-LDPC) codes based on the subgroup of the finite field multiplicative group is proposed. Furthermore, this construction method can effectively avoid the girth-4 phenomena and has the advantages such as simpler construction, easier implementation, lower encoding/decoding complexity, better girth properties and more flexible adjustment for the code length and code rate. The simulation results show that the error correction performance of the QC-LDPC(3 780,3 540) code with the code rate of 93.7% constructed by this proposed method is excellent, its net coding gain is respectively 0.3 dB, 0.55 dB, 1.4 dB and 1.98 dB higher than those of the QC-LDPC(5 334,4 962) code constructed by the method based on the inverse element characteristics in the finite field multiplicative group, the SCG-LDPC(3 969,3 720) code constructed by the systematically constructed Gallager (SCG) random construction method, the LDPC(32 640,30 592) code in ITU-T G.975.1 and the classic RS(255,239) code which is widely used in optical transmission systems in ITU-T G.975 at the bit error rate (BER) of 10^-7. Therefore, the constructed QC-LDPC(3 780,3 540) code is more suitable for optical transmission systems.     

A novel QC-LDPC code based on the finite field multiplicative group for optical communications

A novel construction method of quasi-cyclic low-density parity-check(QC-LDPC) code is proposed based on the finite field multiplicative group,which has easier construction,more flexible code-length code-rate adjustment and lower encoding/decoding complexity.Moreover,a regular QC-LDPC(5334,4962) code is constructed.The simulation results show that the constructed QC-LDPC(5334,4962) code can gain better error correction performance under the condition of the additive white Gaussian noise(AWGN) channel with iterative decoding sum-product algorithm(SPA).At the bit error rate(BER) of 10-6,the net coding gain(NCG) of the constructed QC-LDPC(5334,4962) code is 1.8 dB,0.9 dB and 0.2 dB more than that of the classic RS(255,239) code in ITU-T G.975,the LDPC(32640,30592) code in ITU-T G.975.1 and the SCG-LDPC(3969,3720) code constructed by the random method,respectively.So it is more suitable for optical communication systems.     

一种适用于光通信系统中的QC-LDPC码的构造

为了满足快速发展的光通信系统不断扩大的需求 ,基于有限域的两个不同本原元提出了一种准循环低密度奇偶校 验(Quasi-Cyclic Low-Density Parity-Check,QC-LDPC)码的构造方法,构造的基矩阵 中不含4环,译码时纠错性能良好。将两 个本原元组合,通过调整基矩阵结构,使构造的码字最小距离增大,从而提升码字的纠错性 能。仿真结果表明:在相同 的仿真环境下,当误比特率(Bit Error Rate,BER)为10－6时 ,构造的码率为93.7%的QC-LDPC(3780540)码的净编码增益(Net Coding Gain,NCG)比同样是利用有限域本原元(Primitive Elements,PE)构造的PE-QC-L DPC(3780540)码,提高了0.38dB;同 时,与适用于光通信中利用有限域中两个不同子群(Sub-Groups,SG)构造的SG-QC-LDPC( 3780540)码和已广泛应用于光通 信的ITU-T G.975.1标准中的LDPC(32 640,30592)码相比,净编码增益 分别有0.2dB和0.72dB的提升。     

光通信中基于有限域加群的一种QC-LDPC码

针对光通信系统传输特性要求的日益提高,基于有限域GF(q)加群提出了一种构造简单且适合光通信系统的新颖准循环低密度奇偶校验(QC-LDPC)码构造方法,该构造方法可灵活的调整码长、码率且其编译码复杂度低。用此方法构造了适用于光通信系统的规则QC-LDPC(4599,4307)码。仿真结果表明,在BER=10-7时且码率均为93.7%的情况下,所构造的QC-LDPC(4599,4307)码的净编码器增益(NCG)比已广泛应用于光通信系统中的经典RS(255,239)码提高了约2.2dB,比用SCG构造方法构造的SCG-LDPC(3969,3720)码和非规则的QC-LDPC(3843,3603)码的NCG分别提高了约0.47dB和0.25dB,距离香农限约1dB。因而其纠错性能更强,更适用于高速长距离光通信系统。     

一种高速长距离光通信系统中QC-LDPC码的构造方法

提出了一种新的准循环低密度奇偶校验(QC-LDPC)码的构造方法,给出了用该方法构造无环四QC-LDPC码的充分条件。并针对光通信系统的传输特点,用此方法构造了适用于高速长距离光通信系统的QC-LDPC(4 221,3 956)码。仿真结果分析表明:在码率为93.7%、误码率BER为10-6时,与广泛用于光通信系统中的经典RS(255,239)码相比,其净编码增益(NCG)提高了约1.8dB;比SCG-LDPC(3 969,3 720)码的NCG提高了约0.2dB,距离香农极限约1.4dB,且远低于PEG-LDPC(4 221,3 956)码的错误平层,这正满足光通信系统中低错误平层的要求。     

A novel construction method of QC-LDPC codes based on CRT for optical communications

A novel construction method of quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed based on Chinese remainder theory (CRT). The method can not only increase the code length without reducing the girth, but also greatly enhance the code rate, so it is easy to construct a high-rate code. The simulation results show that at the bit error rate (BER) of 10-7, the net coding gain (NCG) of the regular QC-LDPC(4 851, 4 546) code is respectively 2.06 dB, 1.36 dB, 0.53 dB and 0.31 dB more than those of the classic RS(255, 239) code in ITU-T G.975, the LDPC(32 640, 30 592) code in ITU-T G.975.1, the QC-LDPC(3 664, 3 436) code constructed by the improved combining construction method based on CRTand the irregular QC-LDPC(3 843, 3 603) code constructed by the construction method based on the Galois field (GF(q)) multiplicative group. Furthermore, all these five codes have the same code rate of 0.937. Therefore, the regular QC-LDPC(4 851, 4 546) code constructed by the proposed construction method has excellent error-correction performance, and can be more suitable for optical transmission systems.     

光通信中基于伽罗华域的QC-LDPC码构造方法

为了满足光通信系统对纠错码高码率、低误码率的要求,基于伽罗华域中域的特征提出了一种结构简单、易于编码并且可以有效避免四环的 QC-LDPC(准循环低密度奇偶校验)码的新构造方法。并运用该方法构造了适用于光通信系统的 FC-QC-LDPC(基于域特征的 QC-LDPC)(3969,3729)码。仿真结果表明,在误码率=10-7时,所构造的码率为0.937的 FC-QC-LDPC(3969,3729)码的 NCG (净编码增益)比 QC-LDPC(4288,4020)码提高了约0.15 dB,比 Linshu-QC-LDPC(3780,3542)码和经典的 RS(255,239)码的 NCG分别提高了约0.35和2.1 dB。此外,所构造的码的性能与 Mackay码的性能相当。因而其纠错性能更强,更适用于高速长距离光通信系统。     

基于大衍数列的规则QC-LDPC码构造方法

结合杨辉三角的结构形式,基于大衍数列提出了一种列重为3或4的规则准循环低密度奇偶校验(QC-LDPC)码的新构造方法.该方法构造的校验矩阵围长至少为6,码长可灵活变化,并且可节省存储空间.仿真结果表明:在相同的仿真参数下,当误码率(BER)为10-6时,所构造的列重为3的QC-LDPC(1260,620)码的净编码增益(NCG)比二次函数码改善了1 dB左右;列重为4的QC-LDPC(6056,3028)码相对于WMC-OCS、QC-OCS码分别有0.1 dB和0.2 dB的NCG提升.     

光通信中基于BIBD与循环矩阵分解的QC-LDPC码新颖构造方法

为了满足光通信系统中对纠错码高码率、低误码率(EBR)的要求,基于平衡不完全区组设计(BIBD)和循环矩阵分解,提出一种构造简单的新颖准循环低密度奇偶校验(QC-LDPC)码构造方法,并构造了适用于光通信系统的规则BIBDdes-QC-LDPC(6736,6316)码。仿真结果表明,在BER=10-6时其码率均为93.7%的情况下,所构造的BIBDdes-QC-LDPC(6736,6316)码的净编码增益(NCG)比已广泛应用于光通信系统中的经典RS(255,239)码改善了约2.2dB,并且比只基于BIBD所构造的同码率同码长的规则BIBD-QC-LDPC(6736,6315)和基于伽罗华域(GF)乘群所构造的同码率的非规则QC-LDPC(3843,3603)码都分别改善了约0.2dB。因而,运用本文方法构造的QC-LDPC码型的纠错性能更强,更适用于高速长距离光通信系统。并且,本文方法还具有BIBD构造方法的优点,可灵活地调整码率码长。     

基于参量放大器的光通信系统中QC-LDPC码的研究

由于光在光纤中传输受到色散的作用以及光纤参量 放大器(FOPA)的不理想均会导致光信号在传输过程中的畸 变,从而影响光传输系统的误码率(BER)性能。为了减小高 非线性光纤(HNLF)和泵浦的影响,本文通过采用由最小环长 最大化算法构造的QC-LDPC码作为基于FOPA的40Gbit/s非归零差分 移相键控(NRZ-DPSK)调制光通信系统的前 向纠错码来降低系统的BER,从而达到提高整个通信系统性能 的目的。仿真结果表明,在10km传输光 纤条件下,相同码长不同码率的QC-LDPC码可以使BER达到10－11数量级;在相同码型和不同传输光纤 长度的条件下,BER也可以达到10－11数量级。利用最小环长最大化算法构造的QC-LDPC码可以纠正通 信光在传输中受到光纤色散以及FOPA中HNLF和泵浦抖动引起的相位失配 而导致的误码,从而达到了提高通信质量的目的。     

利用遗传算法构造QC-LDPC码

考虑到围长(girth)对低密度奇偶校验(LDPC)码的影响,提出了一种利用遗传算法构造大girth的准循环LDPC( QC-LDPC)码的新方法。该方法借助于计算机搜索,多次运用遗传算法,分步提高girth,在得到大girth 的同时,构造出具有准循环结构的LDPC码。分析发现,该构造方法的复杂度与码长成线性关系。仿真结果表明：在误码率( BER)为10-6时,新方法构造的QC-LDPC码比基于欧式几何构造方法、Gallager和Mackay构造法分别获得约0.15 dB、0.5 dB和0.2 dB的净编码增益( NCG),且因具有准循环结构更易于存储和硬件实现。     

一种改进的基于中国剩余定理的QC-LDPC码构造方法

为增大QC-LDPC码围长的同时减少码中包含的短环,提高其纠错性能,提出了一种基于中国剩余定理( CRT)的QC-LDPC码改进联合构造方法。该方法将设计围长为g的长码长的QC-LD-PC码的问题简化为设计一个围长为g的短分量码的问题,然后通过对其余分量码校验矩阵的列块进行适当置换,使得构造出的QC-LDPC码具有更少的短环和更优的性能,更适于可靠性要求较高的通信系统。仿真结果表明,与已有的CRT联合构造方法设计的QC-LDPC码相比,新方法构造的QC-LDPC码具有更少的短环,在误码率为10-6时获得了1.2 dB的编码增益。     

空间激光通信中基于原模图的LDPC码构造方法

研究了空间激光通信系统中的信道编码算法,基于原模图和准循环扩展,提出了一种性能优异的低密度奇偶校验(LDPC)码构造方法,可以满足光通信系统中的高速编译码需求。仿真结果表明,构造的LDPC码纠错性能强,在误码率(BER)为10-9数量级处仍未出现误码平底,适合长距离空间激光通信系统。     

Construction of type-II QC-LDPC codes with fast encoding based on perfect cyclic difference sets

In view of the problems that the encoding complexity of quasi-cyclic low-density parity-check (QC-LDPC) codes is high and the minimum distance is not large enough which leads to the degradation of the error-correction performance, the new irregular type-II QC-LDPC codes based on perfect cyclic difference sets (CDSs) are constructed. The parity check matricesof these type-II QC-LDPC codes consist of the zero matrices with weight of 0, the circulant permutation matrices (CPMs) with weight of 1 and the circulant matrices with weight of 2 (W2CMs). The introduction of W2CMs in parity check matrices makes it possible to achieve the larger minimum distance which can improve the error-correction performance of the codes. The Tanner graphs of these codes have no girth-4, thus they have the excellent decoding convergence characteristics. In addition, because the parity check matrices have the quasi-dual diagonal structure, the fast encoding algorithm can reduce the encoding complexity effectively. Simulation results show that the new type-II QC-LDPC codes can achieve a more excellent error-correction performance and have no error floor phenomenon over the additive white Gaussian noise (AWGN) channel with sum-product algorithm (SPA) iterative decoding.     

A novel construction scheme of QC-LDPC codes based on the RU algorithm for optical transmission systems

A novel lower-complexity construction scheme of quasi-cyclic low-density parity-check (QC-LDPC) codes for optical transmission systems is proposed based on the structure of the parity-check matrix for the Richardson-Urbanke (RU) algorithm. Furthermore, a novel irregular QC-LDPC(4 288, 4 020) code with high code-rate of 0.937 is constructed by this novel construction scheme. The simulation analyses show that the net coding gain (NCG) of the novel irregular QC-LDPC(4 288,4 020) code is respectively 2.08 dB, 1.25 dB and 0.29 dB more than those of the classic RS(255, 239) code, the LDPC(32 640, 30 592) code and the irregular QC-LDPC(3 843, 3 603) code at the bit error rate (BER) of 10-6. The irregular QC-LDPC(4 288, 4 020) code has the lower encoding/decoding complexity compared with the LDPC(32 640, 30 592) code and the irregular QC-LDPC(3 843, 3 603) code. The proposed novel QC-LDPC(4 288, 4 020) code can be more suitable for the increasing development requirements of high-speed optical transmission systems.     

利用域间映射的多元QC-LDPC码构造

通过定义有限域间的映射关系,提出了一种低复杂度的多元准循环奇偶校验码( QC-LDPC )的构造方法。利用这种方法可将较高阶数有限域的校验矩阵映射到指定的较低有限域上,且能保持原矩阵的结构性与稀疏特性。所构造的多元LDPC码不仅具有较低的译码复杂度且具有准循环特性,在硬件上也易于用移位寄存器实现。在高斯白噪声( AWGN)信道下的仿真结果表明,所构造的多元QC-LDPC码具有良好的编译码性能。当误码率为10-6时,码率为0.765的QC-LDPC码在目标域GF(8)上能获得0.2 dB的性能增益。     

基于中国剩余定理和贪婪算法扩展的QC-LDPC码

在缩短阵列码的基础上运用中国剩余定理(CRT)和贪婪算法提出了一种新颖的大围长、码长更加灵活的QC-LDPC构造方法,且所构造的码字的校验矩阵采用楼梯矩阵循环置换而成。与传统CRT构造方法相比,只需已知一个分量码——缩短阵列码,同时新构造QC-LDPC码码长与码率选择比较灵活,围长更大,如果围长一样,则使最短环数量尽可能地少。仿真分析表明:在误码率为10-6时,在相同码率和码长的条件下,利用所提出的构造方法所构造的girth-8(4,k)QC-LDPC码在加性高斯白噪声(AWGN)和瑞利衰落信道中分别与缩短阵列码相比可获得约1.2 d B和2.0 d B的净编码增益,与CRT码相比分别改善了0.3 d B和0.7 d B的净编码增益,且性能与Gallager随机码性能相似但编码复杂度大大降低。     

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.     

MacNeish-Mann theorem based iteratively decodable codes for optical communication systems

A novel family of low-density parity-check codes is proposed based on MacNeish-Mann theorem for construction of mutually orthogonal Latin squares. Codes from this family have high code rate, girth at least six, large minimum distance, and significantly outperform conventional forward error correction schemes based on Reed-Solomon (RS) and turbo codes.