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

IEEE International Symposium on Information Theory (ISIT)

Extension of quasi-cyclic LDPC codes by lifting

Seho Myung, Kyeongcheol Yang

Published Jan 1, 2005• 16 citations
Publisher

Abstract

In this paper, we analyze some cycle properties of quasi-cyclic low-density parity-check (QC-LDPC) codes and show that the girth of a QC-LDPC code is upper bounded by a certain number introduced by the structure of its mother matrix. We also propose a simple method to extend QC-LDPC codes of large length by lifting QC-LDPC codes of smaller length. In particular, it is possible to generate them from a single exponent matrix by a proper modulo-operation. Simulation results show that the more we apply the lifting to QC-LDPC codes, the more memory efficiency becomes better, but it may induce a little performance degradation

DOI
10.1109/isit.2005.1523759

Related papers

Lifting methods for quasi-cyclic LDPC codes

Seho Myung, Kyeongcheol Yang, Young‐Kyun Kim

In this paper, we present two simple methods to construct a quasi-cyclic LDPC (QC-LDPC) code of larger length by lifting a given QC-LDPC code. We show that its girth is always larger than or equal to that of the given QC-LDPC code. Applying the methods recursively, it is possible to construct a sequence of QC-LDPC codes generated from a single exponent matrix by proper floor or modulo operations. Simulation results show that they have no serious performance degradation, as compared with randomly constructed LDPC codes

IEEE Communications Letters•Jun 1, 2006•37 citations

Quasi-Cyclic LDPC Codes with Large Girth and Few Short Cycles

Yuanhua Liu

In this paper, we present an improved method for obtaining quasi-cyclic low-density parity-check (QC-LDPC) codes of larger length by combining some component QC-LDPC codes of smaller length.Large girth can be obtained by carefully designing one large girth component code of smaller length.The other component codes are properly designed to obtain a lot of QC-LDPC codes with much few short cycles.Simulations show that compared with CRT based QC-LDPC codes and PEG based QC-LDPC codes, the proposed QC-LDPC codes have much less short cycles and better performance.

International Conference on Manufacturing Science and Engineering (ICMSE)•Jan 1, 2018•0 citations

Efficient Construction of Quasi-Cyclic LDPC Codes With Multiple Lifting Sizes

Huaan Li, Hengzhou Xu, Chao Chen +1 more

In this letter, we present an efficient method for constructing a family of quasi-cyclic low-density parity-check (QC-LDPC) codes specified only by one single exponent matrix that can support multiple lifting sizes. Our method adopts the small-lifting-size-first design strategy and the resulting exponent matrix of larger lifting size has non-decreasing girth. Numerical results show that all constituent codes can perform as well as (outperform) the CCSDS (5G) LDPC codes over the AWGN channel with the iterative decoding algorithms. This fact demonstrates the feasibility and validity of our proposed method and makes it competitive in some applications, e.g., enhancing short and medium-length LDPC codes to support longer length.

IEEE Communications Letters•Jan 31, 2024•11 citations

Necessary conditions for quasi-cyclic LDPC codes to have a given girth

Kyung-Joong Kim, Jin-Ho Chung, Kyeongcheol Yang

Short cycles in the Tanner graph of a low-density parity-check (LDPC) code may cause a severe performance degradation. In this paper, we investigate the cycle properties of quasi-cyclic LDPC (QC-LDPC) codes. We first analyze a necessary and sufficient condition for a cycle of a given length to exist, by using the sequence representation of a parity-check matrix for a QC-LDPC code. We then derive bounds which are necessary conditions for a QC-LDPC code to have a given girth in terms of its parameters. Our necessary conditions are applicable to any regular or irregular QC-LDPC codes as well as they improve the existing bounds for many classes of regular QC-LDPC codes.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2013•0 citations

Matrix-Theoretic Design of Cycle-Aware Quasi-Cyclic LDPC Codes

Qianfan Wang, Hengzhou Xu, Ji Zhang +3 more

Quasi-cyclic low-density parity-check (QC-LDPC) codes are widely adopted in modern communication standards due to their near-capacity performance and hardware-friendly structures. In this paper, we propose a matrix-theoretic, cycleaware framework for constructing QC-LDPC codes from arbitrary base matrices by systematically optimizing their shift values to maximize the girth and minimize the number of cycles with length girth. We present a cycle-aware iterative algorithm that identifies critical edges on the largest number of shortest cycles and modifies their shift values to break multiple cycles simultaneously. The framework supports flexible lifting sizes, which enable a single base matrix to generate codes with arbitrary lengths. Constructive bounds show that girth-6 and girth-8 codes can be achieved with lifting sizes as small as 4 and 14, respectively. Simulation results show that the proposed codes achieve good performance under iterative decoding while retaining the quasicyclic structure essential for hardware implementation.

International Symposium on Wireless Communication Systems•Aug 1, 2026•0 citations

Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices

Farzane Amirzade, Mohammad‐Reza Sadeghi

In this paper, we define two “difference matrices” which correspond to an exponent matrix. We present necessary and sufficient conditions for these difference matrices to have quasi-cyclic low-density parity-check codes (QC-LDPC) codes with a certain girth. We achieve all non-isomorphic QC-LDPC codes with the shortest length, girth 6, the column weight, m = 4, and the row weight, 5 ≤ n ≤ 11. Moreover, a method to obtain an exponent matrix with girth 10 is presented which reduces the complexity of the search algorithm. If the first row and the first column of the exponent matrix are all-zero, then by applying our method we do not need to test Fossorier's lemma to avoid 6-cycles and 8-cycles. For girth 10, we also provide a lower bound on the lifting degree which is tighter than the existing bound. For girth 12, a new lower bound on the lifting degree is achieved.

IEEE Access•Jan 1, 2018•29 citations
In this paper, we analyze some cycle properties of quasi-cyclic low-density parity-check (QC-LDPC) codes and show that the girth of a QC-LDPC code is upper bounded by a certain number introduced by the structure of its mother matrix. We also propose a simple method to extend QC-LDPC codes of large length by lifting QC-LDPC codes of smaller length. In particular, it is possible to generate them from a single exponent matrix by a proper modulo-operation. Simulation results show that the more we apply the lifting to QC-LDPC codes, the more memory efficiency becomes better, but it may induce a little performance degradation
In this paper, we present two simple methods to construct a quasi-cyclic LDPC (QC-LDPC) code of larger length by lifting a given QC-LDPC code. We show that its girth is always larger than or equal to that of the given QC-LDPC code. Applying the methods recursively, it is possible to construct a sequence of QC-LDPC codes generated from a single exponent matrix by proper floor or modulo operations. Simulation results show that they have no serious performance degradation, as compared with randomly constructed LDPC codes
In this paper, we present an improved method for obtaining quasi-cyclic low-density parity-check (QC-LDPC) codes of larger length by combining some component QC-LDPC codes of smaller length.Large girth can be obtained by carefully designing one large girth component code of smaller length.The other component codes are properly designed to obtain a lot of QC-LDPC codes with much few short cycles.Simulations show that compared with CRT based QC-LDPC codes and PEG based QC-LDPC codes, the proposed QC-LDPC codes have much less short cycles and better performance.
In this letter, we present an efficient method for constructing a family of quasi-cyclic low-density parity-check (QC-LDPC) codes specified only by one single exponent matrix that can support multiple lifting sizes. Our method adopts the small-lifting-size-first design strategy and the resulting exponent matrix of larger lifting size has non-decreasing girth. Numerical results show that all constituent codes can perform as well as (outperform) the CCSDS (5G) LDPC codes over the AWGN channel with the iterative decoding algorithms. This fact demonstrates the feasibility and validity of our proposed method and makes it competitive in some applications, e.g., enhancing short and medium-length LDPC codes to support longer length.
Short cycles in the Tanner graph of a low-density parity-check (LDPC) code may cause a severe performance degradation. In this paper, we investigate the cycle properties of quasi-cyclic LDPC (QC-LDPC) codes. We first analyze a necessary and sufficient condition for a cycle of a given length to exist, by using the sequence representation of a parity-check matrix for a QC-LDPC code. We then derive bounds which are necessary conditions for a QC-LDPC code to have a given girth in terms of its parameters. Our necessary conditions are applicable to any regular or irregular QC-LDPC codes as well as they improve the existing bounds for many classes of regular QC-LDPC codes.
Quasi-cyclic low-density parity-check (QC-LDPC) codes are widely adopted in modern communication standards due to their near-capacity performance and hardware-friendly structures. In this paper, we propose a matrix-theoretic, cycleaware framework for constructing QC-LDPC codes from arbitrary base matrices by systematically optimizing their shift values to maximize the girth and minimize the number of cycles with length girth. We present a cycle-aware iterative algorithm that identifies critical edges on the largest number of shortest cycles and modifies their shift values to break multiple cycles simultaneously. The framework supports flexible lifting sizes, which enable a single base matrix to generate codes with arbitrary lengths. Constructive bounds show that girth-6 and girth-8 codes can be achieved with lifting sizes as small as 4 and 14, respectively. Simulation results show that the proposed codes achieve good performance under iterative decoding while retaining the quasicyclic structure essential for hardware implementation.
In this paper, we define two “difference matrices” which correspond to an exponent matrix. We present necessary and sufficient conditions for these difference matrices to have quasi-cyclic low-density parity-check codes (QC-LDPC) codes with a certain girth. We achieve all non-isomorphic QC-LDPC codes with the shortest length, girth 6, the column weight, m = 4, and the row weight, 5 ≤ n ≤ 11. Moreover, a method to obtain an exponent matrix with girth 10 is presented which reduces the complexity of the search algorithm. If the first row and the first column of the exponent matrix are all-zero, then by applying our method we do not need to test Fossorier's lemma to avoid 6-cycles and 8-cycles. For girth 10, we also provide a lower bound on the lifting degree which is tighter than the existing bound. For girth 12, a new lower bound on the lifting degree is achieved.