Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Chinese Science Bulletin (Chinese Version)

围长至少为10 的QC-LDPC 码连续码长的紧致下界

国华 张, 新梅 王, 学远 李, 菊花 王

Published Aug 1, 2010• 0 citations
Publisher

Abstract

和 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 ] .

DOI
10.1360/csb2010-55-22-2257

Related papers

一类girth-8QC-LDPC码构造方法的简化和扩展

Guo‐Hua Zhang, 刘智娟, 王鸣涛

围长(girth)较大的Qc-LDPC码,由于译码性能优良而且便于硬件实现,因此目前已经成为国际信道编码领域的一个研究热点。最近,J—WZhang在第四届多媒体信息网络与安全国际会议上提出了一种构造girth-8(3,L)QC-LDPC码的新方案,但是没有对围长特性和分块矩阵尺寸取值进行理论分析和论证。利用等价变换和最大公约数体系,本文得到了该方案的围长特性和分块矩阵尺寸取值的精确理论结果。此外,还利用最大公约数体系对该方案进行了扩展,得到一种新的围长为8的QC—LDPC码。新码的参数选取范围包含很多原方案不适用的参数选择范围。仿真结果说明,新码在和积译码算法下具有较优良的译码性能。

•Jan 1, 2015•0 citations

Girth Analysis of Quantum Quasi-Cyclic LDPC Codes

Farzane Amirzade, Daniel Panario, Mohammad‐Reza Sadeghi

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.

Problems of Information Transmission•Jun 1, 2024•2 citations

Tanner $(J,L)$ Quasi-Cyclic LDPC Codes: Girth Analysis and Derived Codes

Hengzhou Xu, Huaan Li, Baoming Bai +2 more

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$J$and$L$can 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.

IEEE Access•Dec 10, 2018•21 citations

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

Guo‐Hua Zhang, 陈超, 杨洋 +1 more

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

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•May 19, 2010•0 citations

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

Guo‐Hua Zhang, 王新梅

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

Dianzi xuebao•Jan 1, 2012•0 citations

A fast searching method for the construction of QC-LDPC codes with large girth

Francis C. M. Lau, Wai M. Tam

In this paper, we propose an effective and efficient searching method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with a desired girth g. We begin with an arbitrary QC-LDPC code with girth-4 and we evaluate only the number of cycles with length 4. When all the cycles with length 4 are removed by adjusting the elements of the QC-LDPC code, we form a QC-LDPC code with girth-6. Subsequently, we consider only the numbers of cycles with length 4 and length 6. In general, knowing that the current QC-LDPC code has a girth of g', we only consider the numbers of cycles with length up to g' even though g' may be smaller than the desired girth g. By using an adaptive cost function, which is defined as the number of cycles of length g', in the optimization/searching process, we are able to reduce the computational effort tremendously compared with Wang's searching algorithm [1]. Consequently, our proposed method can generate QC-LDPC codes with the desired girth much more efficiently.

IEEE Symposium on Computers and Communications (ISCC)•Jul 1, 2012•13 citations
和 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 ] .
围长(girth)较大的Qc-LDPC码,由于译码性能优良而且便于硬件实现,因此目前已经成为国际信道编码领域的一个研究热点。最近,J—WZhang在第四届多媒体信息网络与安全国际会议上提出了一种构造girth-8(3,L)QC-LDPC码的新方案,但是没有对围长特性和分块矩阵尺寸取值进行理论分析和论证。利用等价变换和最大公约数体系,本文得到了该方案的围长特性和分块矩阵尺寸取值的精确理论结果。此外,还利用最大公约数体系对该方案进行了扩展,得到一种新的围长为8的QC—LDPC码。新码的参数选取范围包含很多原方案不适用的参数选择范围。仿真结果说明,新码在和积译码算法下具有较优良的译码性能。
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.
Tanner (J,L)(J,L)(J,L) Quasi-Cyclic LDPC Codes: Girth Analysis and Derived Codes
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)(J,L)(J,L)QC-LDPC codes whereJJJandLLLcan 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)(J,L)(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)(J,L)(J,L)QC-LDPC codes. Furthermore, based on the exponent matrices of Tanner(J,L)(J,L)(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码译码性能的一种有效手段.本文提出一种不需要借助于任何计算机搜索步骤,能够直接构造出围长至少为8的QC-LDPC码的显式构造框架.该框架所构造的QC-LDPC码不仅满足围长至少为8的条件,而且还具有循环置换矩阵(CPM)尺寸可以连续变化的优点.该框架可以分为两个步骤:第一步是在无穷大CPM尺寸条件下利用确定性方法构造一个围长至少为8的校验矩阵;第二步是根据本文新发现的一个围长性质,从该校验矩阵的移位矩阵直接精确地计算出CPM尺寸连续变化的紧致下界.
In this paper, we propose an effective and efficient searching method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with a desired girth g. We begin with an arbitrary QC-LDPC code with girth-4 and we evaluate only the number of cycles with length 4. When all the cycles with length 4 are removed by adjusting the elements of the QC-LDPC code, we form a QC-LDPC code with girth-6. Subsequently, we consider only the numbers of cycles with length 4 and length 6. In general, knowing that the current QC-LDPC code has a girth of g', we only consider the numbers of cycles with length up to g' even though g' may be smaller than the desired girth g. By using an adaptive cost function, which is defined as the number of cycles of length g', in the optimization/searching process, we are able to reduce the computational effort tremendously compared with Wang's searching algorithm [1]. Consequently, our proposed method can generate QC-LDPC codes with the desired girth much more efficiently.