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

arXiv:1701.07521

Floor Scale Modulo Lifting for QC-LDPC codes

Nikita Polyanskii, Vasiliy S. Usatyuk, Ilya Vorobyev

Published Jan 25, 2017• 2 citations
arXivHTMLPDF

Abstract

In the given paper we present a novel approach for constructing a QC-LDPC code of smaller length by lifting a given QC-LDPC code. The proposed method can be considered as a generalization of floor lifting. Also we prove several probabilistic statements concerning a theoretical improvement of the method with respect to the number of small cycles. Making some offline calculation of scale parameter it is possible to construct a sequence of QC-LDPC codes with different circulant sizes generated from a single exponent matrix using only floor and scale operations. The only parameter we store in memory is a constant needed for scaling.

DOI
10.48550/arxiv.1701.07521

Related papers

Generalization of floor lifting for QC-LDPC codes

Vasiliy S. Usatyuk, Егоров Сергей Иванович

The given paper presents a method for constructing a QC-LDPC code of shorter length by length adaption from a given QC-LDPC code of maximal length. The proposed method can be considered as a generalization of floor lifting. Making some offline calculation it is possible to construct a sequence of QC-LDPC codes with different circulant sizes generated from a single exponent matrix of QC-LDPC code which has the largest length. The only parameter stored in memory is a constant needed for scaling in the lifting procedure. Simulation results show that the proposed lifting method achieves around a 0.1 dB coding gain on short lengths over previous lifting approaches.

IEEE East-West Design & Test Symposium (EWDTS)•Sep 1, 2017•1 citation

Generalization of Floor Lifting for QC-LDPC Codes: Theoretical Properties and Applications

Ilya Vorobyev, Nikita Polyanskii, German Svistunov +2 more

The given paper presents several probabilistic statements for the methods related to constructing a QC-LDPC code of shorter length by length adaption from a given QC-LDPC code of maximal length. Several probabilistic statements concerning a theoretical improvement of the generalization of floor lifting method with respect to the number of small cycles are proved. Simulation results show that the generalization of floor lifting method under base graph 2 (BG2) allow to achieves from 0.1 to 0.3 dB coding gain.

IEEE East-West Design & Test Symposium (EWDTS)•Sep 1, 2018•3 citations

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

Extension of quasi-cyclic LDPC codes by lifting

Seho Myung, Kyeongcheol Yang

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

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•16 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

Explicit Construction of QC-LDPC Codes Without Short Cycles via Shifting Dual Increasing Sequences

Guohua Zhang, Mei Li, Yi Fang

Explicit construction methods for Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes offer greater descriptive simplicity and stronger applicability than search-based methods. A column weight that is either too large or too small makes it difficult to simultaneously balance the waterfall and error floor regions of the decoding performance curve. Therefore, this paper proposes an explicit construction method for QC-LDPC codes with a column weight approximately equal to 4 via shifting dual increasing sequences. For any given row weight L, this method can directly construct a $4 \times L$ exponent matrix, where evenindexed rows are defined by deterministic mathematical formulas to form dual increasing sequences, and odd-indexed rows are generated by applying cyclic right-shift operations to the corresponding even-indexed rows. Theoretical analysis proves that when the circulant size $\boldsymbol{P}$ is not less than a specific lower bound, the proposed codes achieve a girth of 8. Simulation results demonstrate that the proposed codes outperform benchmark codes constructed using the horizontal symmetrical, column multipliers, and decrease-increase methods, while remaining comparable to product-like counterparts. Furthermore, when combined with the masking operation, their decoding performance is significantly improved compared to the original codes; when combined with the splitting and concatenation operation, the proposed codes outperform the 5G-NR code based on BG2 in the high signal-to-noise regime.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2026•0 citations
In the given paper we present a novel approach for constructing a QC-LDPC code of smaller length by lifting a given QC-LDPC code. The proposed method can be considered as a generalization of floor lifting. Also we prove several probabilistic statements concerning a theoretical improvement of the method with respect to the number of small cycles. Making some offline calculation of scale parameter it is possible to construct a sequence of QC-LDPC codes with different circulant sizes generated from a single exponent matrix using only floor and scale operations. The only parameter we store in memory is a constant needed for scaling.
The given paper presents a method for constructing a QC-LDPC code of shorter length by length adaption from a given QC-LDPC code of maximal length. The proposed method can be considered as a generalization of floor lifting. Making some offline calculation it is possible to construct a sequence of QC-LDPC codes with different circulant sizes generated from a single exponent matrix of QC-LDPC code which has the largest length. The only parameter stored in memory is a constant needed for scaling in the lifting procedure. Simulation results show that the proposed lifting method achieves around a 0.1 dB coding gain on short lengths over previous lifting approaches.
The given paper presents several probabilistic statements for the methods related to constructing a QC-LDPC code of shorter length by length adaption from a given QC-LDPC code of maximal length. Several probabilistic statements concerning a theoretical improvement of the generalization of floor lifting method with respect to the number of small cycles are proved. Simulation results show that the generalization of floor lifting method under base graph 2 (BG2) allow to achieves from 0.1 to 0.3 dB coding gain.
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 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 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.
Explicit construction methods for Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes offer greater descriptive simplicity and stronger applicability than search-based methods. A column weight that is either too large or too small makes it difficult to simultaneously balance the waterfall and error floor regions of the decoding performance curve. Therefore, this paper proposes an explicit construction method for QC-LDPC codes with a column weight approximately equal to 4 via shifting dual increasing sequences. For any given row weight L, this method can directly construct a 4×L4 \times L4×L exponent matrix, where evenindexed rows are defined by deterministic mathematical formulas to form dual increasing sequences, and odd-indexed rows are generated by applying cyclic right-shift operations to the corresponding even-indexed rows. Theoretical analysis proves that when the circulant size P\boldsymbol{P}P is not less than a specific lower bound, the proposed codes achieve a girth of 8. Simulation results demonstrate that the proposed codes outperform benchmark codes constructed using the horizontal symmetrical, column multipliers, and decrease-increase methods, while remaining comparable to product-like counterparts. Furthermore, when combined with the masking operation, their decoding performance is significantly improved compared to the original codes; when combined with the splitting and concatenation operation, the proposed codes outperform the 5G-NR code based on BG2 in the high signal-to-noise regime.