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

Sensors

Constructing Grith Eight GC-LDPC Codes Based on the GCD FLRM Matrix with a New Lower Bound

Kun Zhu, Hongwen Yang

Published Sep 27, 2022• 7 citations
Publisher

Abstract

By connecting multiple short, local low-density parity-check (LDPC) codes with a global parity check, the globally coupled (GC) LDPC code can attain high performances with low complexities. The typical design of a local code is a quasi-cyclic (QC) LDPC for which the code length is proportional to the size of circulant permutation matrix (CPM). The greatest common divisor (GCD)-based full-length row multiplier (FLRM) matrix is constrained by a lower bound of CPM size to avoid six length cycles. In this paper, we find a new lower bound for the CPM size and propose an algorithm to determine the minimum CPM size and the corresponding FLRM matrix. Based on the new lower bound, two methods are proposed to construct the GC-QC-LDPC code of grith 8 based on the GCD based FLRM matrix. With the proposed algorithm, the CPM size can be 45% less than that given by sufficient condition of girth 8. Compared with the conventional GC-LDPC construction, the codes constructed with the proposed method have improved performance and are more flexible in code length and code rate design.

DOI
10.3390/s22197335

Related papers

Full-Length Row-Multiplier QC-LDPC Codes With Girth Eight and Short Circulant Sizes

Juhua Wang, Jianhua Zhang, Quan Zhou +1 more

As a special case of a quasi-cyclic (QC) low-density parity-check (LDPC) code, a full-length row-multiplier (FLRM) QC-LDPC code is described by a compact exponent matrix based on two sequences of integers. The codes designed by a framework known as greatest-common-divisor (GCD) method, belong to a salient class of FLRM QC-LDPC codes, which can eliminate cycles of length up to six by carefully selecting a special sequence subject to a set of simple inequalities. However, the GCD method ensures the absence of these cycles only if circulant sizes are larger than a certain threshold. By combining the existing GCD method, novel sequences and a new analysis method (based on new lemmas of circulants and integers) for modulo equations, a group of novel FLRM QC-LDPC codes free of 4-cycles and 6-cycles are explicitly proposed for column weights from three to five in this paper, which possess circulant sizes much smaller than the forgoing threshold. Simulations show that the new FLRM QC-LDPC codes with shorter lengths perform almost the same as the existing FLRM QC-LDPC codes with longer lengths, and that the novel FLRM QC-LDPC codes noticeably outperform their counterparts with (nearly) identical lengths.

IEEE Access•Jan 1, 2023•11 citations

Construction of Girth-Eight QC-LDPC Codes from Greatest Common Divisor

Guohua Zhang, Rong Xia Sun, Xinmei Wang

For any column weight J and any row weight L, a novel framework is proposed such that a girth-eight (J,L) quasi-cyclic low-density parity-check (QC-LDPC) code with any block length above a lower bound can be constructed via a simple inequality in terms of greatest common divisor (GCD). The main advantage is that the construction of a class of (J,L) girth-eight QC-LDPC codes is transformed into a rather simple task, searching for J integers satisfying the so-called GCD constraint for L. Combining the new method with masking matrices, a class of type-1 QC-LDPC codes is presented with girth at least eight. Simulation results show that the type-1 codes perform better than the random QC-LDPC codes and quadratic-congruence-based QC-LDPC codes for moderate block lengths and low code rates.

IEEE Communications Letters•Jan 2, 2013•47 citations

Automatic Verification of GCD Constraint for Construction of Girth-Eight QC-LDPC Codes

Guohua Zhang, Yi Fang, Yuanhua Liu

As a general method to yield constructions for quasi-cyclic (QC) low-density parity-check (LDPC) codes with girth eight, the greatest-common-divisor (GCD) framework heavily relies on verifying a type of inequalities, referred to as GCD constraints. An algorithm is developed in this letter to automatically verify GCD constraints without conducting any manual analysis, by bounding from above the GCD of a fixed integer and an integer in the form of linear function. As an application of the algorithm, a set of novel constructions based on GCD framework is proposed. From these new constructions, four novel bounds on the size of circulant permutation matrices (CPMs) are formulated, such that girth-eight QC-LDPC codes always exist for any CPM size greater than or equal to the bounds. The new bound for column weight of 6 slightly improves the existing best one, and those for column weights from 7 to 9 significantly strengthen the state-of-the-art ones by decreasing from essentially a cubic or biquadratic power of row weight to a quadratic power of row weight.

IEEE Communications Letters•Jun 28, 2019•11 citations

Algebraic Constructions of Girth-Eight Quasi-Cyclic Matrices with a Multitude of Redundant Rows

Guohua Zhang, Haiyang Liu, Yi Fang

The absence of small cycles in the Tanner graph and the presence of redundant rows in the parity-check matrix (PCM) are two main tactics to improve the decoding performance of a quasi-cyclic (QC) low-density parity-check (LDPC) code from the construction point of view. Existing systematic methods to yield a PCM with a multitude of redundant rows impose very severe restrictions on the circulant size and guarantee the elimination of only 4-cycles. By exploiting the greatest-common-divisor (GCD) framework, several existing methods are identified and two new methods are proposed to generate PCMs with relatively flexible circulant sizes, a considerable number of redundant rows and no 4-cycles and 6-cycles in the associated Tanner graphs. Moreover, the rank of the PCM associated with each of these methods is theoretically proved for odd circulant sizes. Simulation results show that, the proposed QC-LDPC codes can achieve better decoding performance compared with those from the progressive-edge-growth (PEG) and search-based symmetrical methods whose PCMs contain basically no redundant rows.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2026•0 citations

Quasi-Cyclic Spatially Coupled LDPC Codes Construction with Girth Eight

Shikui Guo, Guohua Zhang

Small cycles in spatially coupled low-density paritycheck (SC-LDPC) codes have a detrimental effect on the error floor. Recently, an explicit simple method has been proposed to construct a class of 4-cycle free SC-LDPC codes by partitioning a spreading matrix into a number of component matrices. Using a quasi-cyclic (QC) lifting, we propose a component matrices construction method to obtain QC-SC-LDPC codes with a girth eight in this paper. The component matrices of the new method are completely defined by a spreading matrix and an exponent matrix. The spreading matrix is constructed from a finite sequence of integers, and the exponent matrix is constructed from the greatest common divisor (GCD) framework. The novel construction method demonstrates the capacity to entirely eliminate 6-cycles. Compared to the recently proposed explicit structural design, the proposed code achieves a girth of eight and exhibits better bit-error rate (BER) performance.

IEEE/CIC International Conference on Communications in China (ICCC)•Aug 10, 2025•0 citations

New Construction of QC-LDPC Codes Based on Full-Length Row-Multiplier

Ke Jia, Yu Qin, Mei Li

This paper proposes a new explicit construction method for quasi-cyclic (QC) low-density parity-check (LDPC) codes without 4-cycles and 6-cycles with large column weights. Two integer sequences entirely define the exponent matrix of the new method. The first sequence is an arithmetic sequence starting from 0 with a tolerance of 1, and the second sequence is a special sequence composed of integers that meet the constraint of the greatest common divisor (GCD). The existing explicit method can only provide a variety of row weight types with large circulant size. Compared with the recently proposed symmetric structure method based on computer search, the new explicit construction method has better decoding performance, extremely low description complexity, and does not require computer search.

IEEE International Conference on Communication Technology (ICCT)•Oct 18, 2024•0 citations
By connecting multiple short, local low-density parity-check (LDPC) codes with a global parity check, the globally coupled (GC) LDPC code can attain high performances with low complexities. The typical design of a local code is a quasi-cyclic (QC) LDPC for which the code length is proportional to the size of circulant permutation matrix (CPM). The greatest common divisor (GCD)-based full-length row multiplier (FLRM) matrix is constrained by a lower bound of CPM size to avoid six length cycles. In this paper, we find a new lower bound for the CPM size and propose an algorithm to determine the minimum CPM size and the corresponding FLRM matrix. Based on the new lower bound, two methods are proposed to construct the GC-QC-LDPC code of grith 8 based on the GCD based FLRM matrix. With the proposed algorithm, the CPM size can be 45% less than that given by sufficient condition of girth 8. Compared with the conventional GC-LDPC construction, the codes constructed with the proposed method have improved performance and are more flexible in code length and code rate design.
As a special case of a quasi-cyclic (QC) low-density parity-check (LDPC) code, a full-length row-multiplier (FLRM) QC-LDPC code is described by a compact exponent matrix based on two sequences of integers. The codes designed by a framework known as greatest-common-divisor (GCD) method, belong to a salient class of FLRM QC-LDPC codes, which can eliminate cycles of length up to six by carefully selecting a special sequence subject to a set of simple inequalities. However, the GCD method ensures the absence of these cycles only if circulant sizes are larger than a certain threshold. By combining the existing GCD method, novel sequences and a new analysis method (based on new lemmas of circulants and integers) for modulo equations, a group of novel FLRM QC-LDPC codes free of 4-cycles and 6-cycles are explicitly proposed for column weights from three to five in this paper, which possess circulant sizes much smaller than the forgoing threshold. Simulations show that the new FLRM QC-LDPC codes with shorter lengths perform almost the same as the existing FLRM QC-LDPC codes with longer lengths, and that the novel FLRM QC-LDPC codes noticeably outperform their counterparts with (nearly) identical lengths.
For any column weight J and any row weight L, a novel framework is proposed such that a girth-eight (J,L) quasi-cyclic low-density parity-check (QC-LDPC) code with any block length above a lower bound can be constructed via a simple inequality in terms of greatest common divisor (GCD). The main advantage is that the construction of a class of (J,L) girth-eight QC-LDPC codes is transformed into a rather simple task, searching for J integers satisfying the so-called GCD constraint for L. Combining the new method with masking matrices, a class of type-1 QC-LDPC codes is presented with girth at least eight. Simulation results show that the type-1 codes perform better than the random QC-LDPC codes and quadratic-congruence-based QC-LDPC codes for moderate block lengths and low code rates.
As a general method to yield constructions for quasi-cyclic (QC) low-density parity-check (LDPC) codes with girth eight, the greatest-common-divisor (GCD) framework heavily relies on verifying a type of inequalities, referred to as GCD constraints. An algorithm is developed in this letter to automatically verify GCD constraints without conducting any manual analysis, by bounding from above the GCD of a fixed integer and an integer in the form of linear function. As an application of the algorithm, a set of novel constructions based on GCD framework is proposed. From these new constructions, four novel bounds on the size of circulant permutation matrices (CPMs) are formulated, such that girth-eight QC-LDPC codes always exist for any CPM size greater than or equal to the bounds. The new bound for column weight of 6 slightly improves the existing best one, and those for column weights from 7 to 9 significantly strengthen the state-of-the-art ones by decreasing from essentially a cubic or biquadratic power of row weight to a quadratic power of row weight.
The absence of small cycles in the Tanner graph and the presence of redundant rows in the parity-check matrix (PCM) are two main tactics to improve the decoding performance of a quasi-cyclic (QC) low-density parity-check (LDPC) code from the construction point of view. Existing systematic methods to yield a PCM with a multitude of redundant rows impose very severe restrictions on the circulant size and guarantee the elimination of only 4-cycles. By exploiting the greatest-common-divisor (GCD) framework, several existing methods are identified and two new methods are proposed to generate PCMs with relatively flexible circulant sizes, a considerable number of redundant rows and no 4-cycles and 6-cycles in the associated Tanner graphs. Moreover, the rank of the PCM associated with each of these methods is theoretically proved for odd circulant sizes. Simulation results show that, the proposed QC-LDPC codes can achieve better decoding performance compared with those from the progressive-edge-growth (PEG) and search-based symmetrical methods whose PCMs contain basically no redundant rows.
Small cycles in spatially coupled low-density paritycheck (SC-LDPC) codes have a detrimental effect on the error floor. Recently, an explicit simple method has been proposed to construct a class of 4-cycle free SC-LDPC codes by partitioning a spreading matrix into a number of component matrices. Using a quasi-cyclic (QC) lifting, we propose a component matrices construction method to obtain QC-SC-LDPC codes with a girth eight in this paper. The component matrices of the new method are completely defined by a spreading matrix and an exponent matrix. The spreading matrix is constructed from a finite sequence of integers, and the exponent matrix is constructed from the greatest common divisor (GCD) framework. The novel construction method demonstrates the capacity to entirely eliminate 6-cycles. Compared to the recently proposed explicit structural design, the proposed code achieves a girth of eight and exhibits better bit-error rate (BER) performance.
This paper proposes a new explicit construction method for quasi-cyclic (QC) low-density parity-check (LDPC) codes without 4-cycles and 6-cycles with large column weights. Two integer sequences entirely define the exponent matrix of the new method. The first sequence is an arithmetic sequence starting from 0 with a tolerance of 1, and the second sequence is a special sequence composed of integers that meet the constraint of the greatest common divisor (GCD). The existing explicit method can only provide a variety of row weight types with large circulant size. Compared with the recently proposed symmetric structure method based on computer search, the new explicit construction method has better decoding performance, extremely low description complexity, and does not require computer search.