Girth-8 (3,L)-规则QC-LDPC码的一种确定性构造方法

对于围长(girth)至少为8的低密度奇偶校验(LDPC)码,目前的绝大多数构造方法都需要借助于计算机搜索。受贪婪构造算法启发,该文利用完全确定的方式构造出一类围长为8的(3, L)- 规则QC-LDPC码。这类QC-LDPC码的校验矩阵由3L个PP的循环置换矩阵构成。对于任意整数P3L2/4,这类校验矩阵的围长均为8。     

基于中国剩余定理和贪婪算法扩展的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随机码性能相似但编码复杂度大大降低。     

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

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

基于大衍数列的规则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提升.     

光通信系统中一种新颖的满秩QC-LDPC码的构造方法研究

为使低密度奇偶校验(LDPC)码高效地应用于光通信系统中,针对光通信系统的传输特点,提出了一种新颖的基于循环置换矩阵和掩蔽矩阵构造满秩准循环低密度奇偶校验(QC-LDPC)码的方法。该方法定义了一类基矩阵,由基矩阵扩展出循环置换矩阵,构造出围长至少为8的校验矩阵;提出了掩蔽矩阵的设计规则,并利用设计的掩蔽矩阵对前面得到的校验矩阵进行变换,构造出围长至少为8的满秩QC-LDPC码。与多种不同的QC-LDPC码构造方法进行理论分析和性能仿真比较,结果表明,利用该方法构造出的LDPC码字是满秩的,具有严格的准循环特性和优异的纠错性能,且构造灵活。该方法构造的码字适用于光通信系统。     

卫星激光通信中基于Zig-Zag结构的原模图QC-LDPC码构造方法

为应对卫星激光通信信道的时变性、改善传输的可靠性,提出一种基于Zig-Zag结构的原模图QC-LDPC码构造方法.该方法将原模图与Zig-Zag结构的移位系数设计方法相结合,构造校验矩阵围长至少为8且码长码率可灵活选择的ZZ-QC-LDPC码.仿真结果表明:该方法所构造的ZZ-QC-LDPC码在误码率为10-6时,与同码率下基于等差数列和原模图构造的QC-LDPC码和基于最大公约数构造的QC-LDPC码以及具有大围长快速编码特性的QC-LDPC码相比,其净编码增益分别提高了约0.2,0.1和0.64 dB,且在较大码率范围内均具有良好的纠错性能.     

围长至少为8的QC-LDPC码的新构造:一种显式框架

 构造围长较大的校验矩阵,是提高二进制和多进制QC-LDPC码译码性能的一种有效手段.本文提出一种不需要借助于任何计算机搜索步骤,能够直接构造出围长至少为8的QC-LDPC码的显式构造框架.该框架所构造的QC-LDPC码不仅满足围长至少为8的条件,而且还具有循环置换矩阵(CPM)尺寸可以连续变化的优点.该框架可以分为两个步骤:第一步是在无穷大CPM尺寸条件下利用确定性方法构造一个围长至少为8的校验矩阵;第二步是根据本文新发现的一个围长性质,从该校验矩阵的移位矩阵直接精确地计算出CPM尺寸连续变化的紧致下界.     

利用完备差集构造QC-LDPC码

针对准循环低密度奇偶校验( QC-LDPC)码中循环置换矩阵的移位次数的确定问题,提出了一种利用组合设计中完备差集( PDF)构造QC-LDPC码的新颖方法。当循环置换矩阵的维度大于一定值时,该方法所构造的规则QC-LDPC码围长至少为6,具有灵活选择码长和码率的优点,且所需的存储空间更少,降低了硬件实现的复杂度。仿真结果表明：在误码率为10-5时,所构造的码率为3/4的PDF-QC-LDPC(3136,2352)与基于最大公约数(GCD)构造的GCD-QC-LDPC(3136,2352)码和基于循环差集(CDF)构造的CDF-QC-LDPC(3136,2352)码相比,其净编码增益(NCG)分别有0.41 dB和0.32 dB的提升;且在码率为4/5时,所构造的PDF-QC-LDPC (4880,3584)码比GCD-QC-LDPC(4880,3584)码和CDF-QC-LDPC(4880,3584)码的NCG分别改善了0.21 dB和0.13 dB。     

利用等差数列构造大围长准循环低密度奇偶校验码

针对准循环低密度奇偶校验(QC-LDPC)码中准循环基矩阵的移位系数确定问题,该文提出基于等差数列(AP)的确定方法。该方法构造的校验矩阵的围长至少为8,移位系数由简单的数学表达式确定,节省了编解码存储空间。研究结果表明,该方法对码长和码率参数的设计具有较好的灵活性。同时表明在加性高斯白噪声(AWGN)信道和置信传播(BP)译码算法下,该方法构造的码字在码长为1008、误比特率为10-5时,信噪比优于渐进边增长(PEG)码近0.3 dB。     

卫星激光通信中基于Fibonacci数列与GCD序列的非规则QC-LDPC码构造方法

为提高卫星激光通信系统的可靠性,节约其硬件资源,提出一种基于斐波那契(Fibonacci)数列与最大公约数(GCD)序列的非规则准循环低密度奇偶校验(Quasi-Cyclic Low-Density Parity-Check, QC-LDPC)码构造方法。该方法通过由Fibonacci数列与GCD序列组合构造的循环移位矩阵扩展原模图基矩阵,从而得到校验矩阵。所构造的校验矩阵围长至少为6且码长码率可灵活选择,需存储元素少,利于硬件实现,较适用于卫星激光通信系统。仿真结果表明,采用该方法构造的非规则QC-LDPC码与相同码率码长的基于完备差集的非规则Type-I QC-LDPC码、基于消除陷阱集的有限长度非规则FL-QC-LDPC码、基于GCD可快速编译的非规则GL-QC-LDPC码以及基于矩阵扩展的非规则RC-LDPC码相比,其净编码增益均有一定提高。     

Large girth quasi-cyclic LDPC codes based on the chinese remainder theorem

In this letter, we consider two problems associated with quasi-cyclic low-density parity-check (QC-LDPC) codes. The first is how to extend the code length of a QC-LDPC code without reducing the girth. The second is how to design a QCLDPC code with a prescribed girth easily. We deal with these two problems by using a combining method of QC-LDPC codes via the Chinese Remainder Theorem (CRT). Codes constructed with our proposed method have flexible code lengths, flexible code rates and large girth. Simulation results show that they perform very well with the iterative decoding.     

High Rate APPS and Bi-APPS LDPC Codes Design with Low Error Floor and Large Girth

In this paper, two new methods to construct low-density parity-check (LDPC) codes with low error floor and large girth are proposed. The first one is APPS-LDPC codes based on Arithmetic Progression theory and cycle classification, whose girth is at least eight. Based on the designed APPS-LDPC codes, we further construct Bi-diagonal APPS-LDPC codes with column degree 4, whose circulant permutation matrix is combined by two shifted identity matrix. The designed APPS-LDPC code has 0.25 and 0.2 dB coding gain compared to partition-and-shift (PS)-LDPC code and progressive-edge-growth (PEG)-LDPC code. And the Bi-APPS-LDPC code has similar performance to T2 LDPC code in CCSDS standard, but its effective structure is more suitable for high throughput decoder implementation on FPGA. Both codes have less construction complexity than PS-LDPC code and PEG-LDPC code.     

Explicit construction of families of LDPC codes with no 4-cycles

Low-density parity-check (LDPC) codes are serious contenders to turbo codes in terms of decoding performance. One of the main problems is to give an explicit construction of such codes whose Tanner graphs have known girth. For a prime power q and m/spl ges/2, Lazebnik and Ustimenko construct a q-regular bipartite graph D(m,q) on 2q/sup m/ vertices, which has girth at least 2/spl lceil/m/2/spl rceil/+4. We regard these graphs as Tanner graphs of binary codes LU(m,q). We can determine the dimension and minimum weight of LU(2,q), and show that the weight of its minimum stopping set is at least q+2 for q odd and exactly q+2 for q even. We know that D(2,q) has girth 6 and diameter 4, whereas D(3,q) has girth 8 and diameter 6. We prove that for an odd prime p, LU(3,p) is a [p/sup 3/,k] code with k/spl ges/(p/sup 3/-2p/sup 2/+3p-2)/2. We show that the minimum weight and the weight of the minimum stopping set of LU(3,q) are at least 2q and they are exactly 2q for many LU(3,q) codes. We find some interesting LDPC codes by our partial row construction. We also give simulation results for some of our codes.     

Rate-compatible convolutional codes for multirate DS-CDMA systems

New rate-compatible convolutional (RCC) codes with high constraint lengths and a wide range of code rates are presented. These new codes originate from rate 1/4 optimum distance spectrum (ODS) convolutional parent encoders with constraint lengths 7-10. Low rate encoders (rates 115 down to 1/10) are found by a nested search, and high rate encoders (rates above 1/4) are found by rate-compatible puncturing. The new codes form rate-compatible code families more powerful and flexible than those previously presented. It is shown that these codes are almost as good as the existing optimum convolutional codes of the same fates. The effects of varying the design parameters of the rate-compatible punctured convolutional (RCPC) codes, i.e., the parent encoder rate, the puncturing period, and the constraint length, are also examined. The new codes are then applied to a multicode direct-sequence code-division multiple-access (DS-CDMA) system and are shown to provide good performance and rate-matching capabilities. The results, which are evaluated in terms of the efficiency for Gaussian and Rayleigh fading channels, show that the system efficiency increases with decreasing code rate     

大小兼容的阵列LDPC码设计的新方法

阵列LDPC码构造简单,又易于VLSI实现.文献[4]对其进行了改进,支持任意码长,称为大小兼容的阵列LDPC码(记为SC阵列LDPC码).对于SC阵列LDPC码,本文提出3种改进方法,方法1对文献[4]SC阵列LDPC码进行了完善,排除了因k不是L的因子而产生的错误.方法2、3研究了新的子矩阵排列方法.这些方法对码的距离特性和误码性能都有很大改善.不仅在AWGN信道,还在UWB CM3信道上,通过仿真,证明了其良好性能.     

任意列重大围长QC-LDPC码的确定性构造

针对准循环低密度奇偶校验（Quasi-Cyclic Low-Density Parity-Check,QC-LDPC）码中准循环基矩阵的移位系数确定问题,提出基于等差数列的确定方法.该方法构造的校验矩阵围长为8,列重可任意选取,移位系数由简单的数学表达式确定,编码复杂度与码长呈线性关系,节省了编解码存储空间.研究结果表明,列重和围长是影响码字性能的重要因素.在加性高斯白噪声（Additive White Gauss Noise,AWGN）信道和置信传播（Belief Propagation,BP）译码算法下,该方法构造的码字在短码时可以获得与IEEE 802.11n、802.16e码相一致的性能,在长码时误比特率性能接近DVB-S2码.同时表明该方法对码长和码率参数的设计具有较好的灵活性.     

A lattice-based systematic recursive construction of quasi-cyclic LDPC codes

This paper presents a low-complexity recursive and systematic method to construct good well-structured low-density parity-check (LDPC) codes. The method is based on a recursive application of a partial Kronecker product operation on a given gamma x q, q ges 3 a prime, integer lattice L(gamma x q). The (n - 1)- fold product of L(gamma x q) by itself, denoted Lⁿ(gamma x q), represents a regular quasi-cyclic (QC) LDPC code, denoted (see PDF), of high rate and girth 6. The minimum distance of (see PDF) is equal to that of the core code (see PDF) introduced by L(gamma x q). The support of the minimum weight codewords in (see PDF) are characterized by the support of the same type of codewords in (see PDF). From performance perspective the constructed codes compete with the pseudorandom LDPC codes.     

Improved coding techniques for preceded partial-response channels

A coset of a convolutional code may be used to generate a zero-run length limited trellis code for a 1-D partial-response channel. The free squared Euclidean distance, d_free², at the channel output is lower bounded by the free Hamming distance of the convolutional code. The lower bound suggests the use of a convolutional code with maximal free Hamming distance, d_max(R,N), for given rate R and number of decoder states N. In this paper we present cosets of convolutional codes that generate trellis codes with d_free ²>d_max(R,N) for rates 1/5⩽R⩽7/9 and (d _free²=d_max(R,N) for R=13/16,29/32,61/64, The tabulated convolutional codes with R⩽7/9 were not optimized for Hamming distance. Instead, a computer search was used to determine cosets of convolutional codes that exploit the memory of the 1-D channel to increase d_free² at the channel output. The search was limited by only considering cosets with certain structural properties. The R⩾13/16 codes were obtained using a new construction technique for convolutional codes with free Hamming distance 4. Newly developed bounds on the maximum zero-run lengths of cosets were used to ensure a short maximum run length at the 1-D channel output     

Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than 12

A quasi-cyclic (QC) low-density parity-check (LDPC) code can be viewed as the protograph code with circulant permutation matrices (or circulants). In this correspondence, we find all the subgraph patterns of protographs of QC LDPC codes having inevitable cycles of length 2i, i = 6, 7, 8, 9,10, i.e., the cycles that always exist regardless of the shift values of circulants. It is also derived that if the girth of the protograph is 2g, g > 2, its protograph code cannot have the inevitable cycles of length smaller than 6g. Based on these subgraph patterns, we propose new combinatorial construction methods of the protographs, whose protograph codes can have girth larger than or equal to 14 or 18. We also propose a couple of shift value assigning rules for circulants of a QC LDPC code guaranteeing the girth 14.