围长(girth)较大的Qc-LDPC码,由于译码性能优良而且便于硬件实现,因此目前已经成为国际信道编码领域的一个研究热点。最近,J—WZhang在第四届多媒体信息网络与安全国际会议上提出了一种构造girth-8(3,L)QC-LDPC码的新方案,但是没有对围长特性和分块矩阵尺寸取值进行理论分析和论证。利用等价变换和最大公约数体系,本文得到了该方案的围长特性和分块矩阵尺寸取值的精确理论结果。此外,还利用最大公约数体系对该方案进行了扩展,得到一种新的围长为8的QC—LDPC码。新码的参数选取范围包含很多原方案不适用的参数选择范围。仿真结果说明,新码在和积译码算法下具有较优良的译码性能。
文章提出了一种基于模拟退火算法的准循环校验矩阵设计方法。首先,建立了一类具有特殊结构的准循环校验矩阵的设计步骤与模拟退火算法中迭代初始解、目标函数和邻域结构之间的联系,然后利用有记忆的模拟退火算法设计出了两个准循环校验矩阵。利用这两个矩阵,文章对于任意P≥217构造出了girth-12(3,5)规则QC—LDPC码;对于任意P≥449构造出了girth.12(3,6)规则QC-LDPC码。与已知的最好结果相比,该文将girth-12(3,5)和(3,6)规则QC—LDPC码连续存在的码长下限分别降低了420比特和492比特。
和 L, 则相应的 LDPC 码称为(R,L)LDPC 码; 若校验 矩阵是一个由循环置换矩阵构成的阵列, 则相应的 LDPC 码称为准循环(QC-)LDPC 码. 本文将围长至少 为 g 记为 girth-g + , 将围长恰好为 g 记为 girth-g.采用 各种思路, 人们目前已经开发出一些构造 girth-10 + (3, L)LDPC 码的方法.这些巧妙的思路包括: 容许斜率 对 [8] 、二次置换多项式 [9] 、平衡环路 [10] 、控制方程 [11] 、 网格 [12] 、三维循环网格 [13] 、邻接矩阵理论 [14] 和爬山算 法 [ 1 5 ] .
Quantum quasi-cyclic LDPC (QQC LDPC) codes, as CSS (Calderbank, Shor, and Steane) codes, are attracting attention because of their good structure and popular channel coding schemes. Fully connected quasi-cyclic LDPC (QC-LDPC) codes with different girths which result in QQC-LDPC codes are investigated. We analytically prove that QC-LDPC codes with column weight at least 3, which yield a QQC-LDPC code, have girth at most 6. To obtain a QQC-LDPC code from QC-LDPC codes with girth more than 6 we should focus on QC-LDPC codes with column weight 2. We present an efficient and practical method to construct these codes with girth at least 8. Then, we extend our method to construct codes with column weight 2 and girth 12, thus reaching the largest possible girth.
Girth plays an important role in the design of low-density parity-check (LDPC) codes. Motivated by the works on the girth of some classes of Tanner quasi-cyclic (QC) LDPC codes, e.g., Tanner (3, 5), (3, 7), (3, 11), and (5, 7) codes, we, in this paper, study the girth of Tanner
(J,L)QC-LDPC codes where
Jand
Lcan be any two positive integers. According to the sufficient and necessary conditions for the existence of cycles of lengths 4, 6, 8, and 10, we propose an algorithm to determine the girth of Tanner
(J,L)QC-LDPC codes with finite code lengths. Through the analysis of the obtained girth values, we generalize the laws of the girth distributions of Tanner
(J,L)QC-LDPC codes. Furthermore, based on the exponent matrices of Tanner
(J,L)QC-LDPC codes with known girths, we employ the column selection method and/or the masking technique to construct binary/nonbinary LDPC codes. The numerical results show that the constructed LDPC codes have good performance under iterative decoding over the additive white Gaussian noise channel.
为了扩展QC—LDPC码的逐步边增加(Progressivee dge—growth,PEG)算法,在分析Kronecker积和PEG基本算法的基础上,结合校验矩阵节点的度分布要求,提出了一种QC—LDPC码的Kronecker积一PEG普适算法。该算法通过引入Kronecker积实现基矩阵的构造,同时确定循环移位矩阵,进一步根据变量节点和校验节点的度分布要求完成了QC-LDPC码的设计,分析并证明了该算法的环长至少为girth-8。对算法性能进行了仿真验证,结果表明,该算法在保持QC—LDPC码低密度特征和良好误码性能的同时具有普适性。