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 Vehicular Technology Conference

Design of QC-LDPC Codes at Finite Lengths

Hyunki Kim, Eugene Ha, Jeongseok Ha

Published Sep 1, 2026• 0 citations
Publisher

Abstract

This paper proposes a finite-length quasi-cyclic low-density parity-check (QC-LDPC) code design framework based on protograph extrinsic information transfer (PEXIT) analysis, with the objective of minimizing the number of iterations required to meet a target error probability. First, the design$E_{b}/N_{0}$is selected from channel-capacity considerations and is refined for finite-length operation by explicitly accounting for the block length and the target error requirement. Then, at the resulting$E_{b}/N_{0}$, the mutual-information trajectory predicted by the PEXIT chart is exploited to track the evolution of the word error probability. Leveraging this estimate, we introduce a systematic greedy design rule that obviates exhaustive search by progressively removing edges from an initial base matrix subject to structural constraints, thereby markedly reducing the design complexity while improving convergence behavior in terms of the required iteration count.

DOI
10.1109/vtc2026-fall68024.2026.11758491

Related papers

Design of Protograph-Based LDPC Codes with Limited Decoding Complexity

Chengjun Tang, Ming Jiang, Chunming Zhao +1 more

In this letter, we present a design method to find good protograph-based low-density parity-check codes with the numbers of nonzero elements in the parity-check matrix and decoding iterations both strictly limited. We utilize the protograph-based extrinsic information transfer (PEXIT) analysis to evaluate the error performance and employ the differential evolution algorithm to devise a well-performed coding scheme. In particular, the number of iterations in the PEXIT analysis is set to a small value due to the limited iterations in the decoding process. Both numerical analyses and simulations verify that the resulting codes exhibit better performance than conventional code designs under the limitation of decoding complexity.

IEEE Communications Letters•Sep 29, 2017•18 citations

Protograph Sieving Method for Construction Moderate Length Multi-Edge Type QC-LDPC Codes

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

We introduce the protograph sieving method as a tool for optimization of moderate length Multi-Edge Type Quasi-Cyclic Low-Density Parity-Check (MET QC-LDPC)codes. The proposed method allows to improve code distance property with defined graph balanced cycles and construct MET-LDPC protograph for the code length in gap between Scattering PEXIT-chart and Covariance Evolution methods. We show that this approach improves code distance properties and achieves 0.2 dB gain in terms of block error rate (BLER)over the additive white Gaussian noise (AWGN)channel for information length of 600 bits and rate 1/3, at a target BLER of 10-6when compared to BG2 MET-LDPC code proposed at 5G standard.

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

Optimized Construction of Short and High Rate Protograph QC-LDPC Codes

Jianrong Bao, Xiaorong Xu, Chao Liu +2 more

To obtain efficient and pragmatic channel codes high signal-to-noise ratios (SNRs), an optimized construction of short and high rate protograph quasi-cyclic (QC) low-density parity-check (LDPC) codes is presented. Based on an optimized protograph template, the code framework is firstly produced by the extensions of the variable nodes. By enlarging the dimension of the sub-matrices related to the protograph framework, the base quasi-cyclic (QC) matrix is generated with required code rate and length. Then, the elements in the base matrix are split with even smaller square sub-matrices of the same row and column weights. In this procedure, a progressive edge growth (PEG) algorithm is employed to find the optimized positions of the QC submatrices, which brings larger girth for better code performance. Also the circulant offsets in all QC sub-matrices are optimally searched by a QC improved approximated cycle extrinsic message degree (QCI-ACE) algorithm, which improves the relationship of the unavoidable loops in the code's Tanner graph and thus it improves the error floor. Simulation results show that the codes produced by the proposed method demonstrate quite good bit error rate (BER) performance. In addition, they exhibit good properties of high spectrum efficiency by the high code rate, as well as the low complexity by the short code length. Therefore, the proposed code construction can be efficiently applied in the design of short and high rate protograph QC-LDPC codes with high rate and rational complexity.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 20, 2021•1 citation

Construction of Efficient High-Rate Protograph QC-LDPC Codes by Joint EXIT Chart, PEG, AWD, and QC-NLACE Techniques

Yiqun Chen, Jianrong Bao, Yanhai Shang +2 more

To obtain efficient channel codes with high power efficiency at moderate signal-to-noise ratios (SNRs), an efficient high-rate protograph quasi-cyclic (QC) low-density parity-check (LDPC) codes is optimally constructed. By an optimized protograph template, the code framework is firstly produced by the extensions of the variable nodes. By enlarging the dimension of the sub-matrices related to the protograph framework, the base QC matrix template is generated with required code rate and length by the extrinsic information transfer (EXIT) chart for better decoding threshold. Then, the elements in the base matrix are split with even smaller square sub-matrices of the same row and column weights. In this procedure, a progressive-edge-growth (PEG) algorithm is employed to find the optimized positions of the QC sub-matrices to obtain larger girth for better error floor performance. Moreover, an asymptotic weight distribution (AWD) is employed to keep a low-code-error floor for the code. Also the circulant offsets in all QC sub-matrices are optimally searched by a QC oriented nested loop approximated cycle extrinsic message degree (QC-NLACE) algorithm, which improves the relationship of the unavoidable loops in the code's Tanner graph to cut the error floor. Simulation results show that the codes produced by the proposed method show quite good bit-error-rate (BER) performance. In addition, they exhibit good properties of high spectrum efficiency brought by the high code rate, and the low complexity by the short code length. Moreover, a series of different rate-compatible LDPC codes can be generated from the same protograph framework with some variable node extensions, which significantly eases the code design. Therefore, the proposed code construction can be efficiently applied in the optimal construction of high-rate and short-length rate-compatible QC-LDPC codes with a high data rate and rational complexity, which makes the codes extremely suited for use in new-generation power-constrained wireless communications.

Entropy•May 28, 2026•0 citations

Construction of Irregular Protograph-Based QC-LDPC Codes With Low Error Floor

Bashirreza Karimi, Amir H. Banihashemi

In this article, we design finite-length irregular protograph-based quasi-cyclic (QC) low-density parity-check (LDPC) codes with good waterfall performance and low error floor. To achieve a low error floor, we eliminate a targeted set of dominant elementary trapping sets (ETS) £ in the Tanner graph of the code. For a given rate and girth, the codes are designed to be free of the largest set of problematic ETSs for a given block length, or to have the shortest block length while a given set of ETSs is avoided. The design is based on a search algorithm that identifies whether any instance of any structure within £ exists in the Tanner graph of the constructed code or not. The search algorithm performs this task with minimal complexity, making it feasible to construct practical codes by running the search algorithm a large number of times. Simulation results are provided to demonstrate the superior performance of designed codes compared to similar state-of-the-art irregular QC-LDPC codes.

IEEE Transactions on Communications•Oct 2, 2020•19 citations

Rate‐compatible QC‐LDPC codes based on PEXIT

Yuanhua Liu

An improved extension method based on protograph extrinsic information transfer (PEXIT) charts is proposed to design rate‐compatible quasi‐cyclic low‐density parity‐check (QC‐LDPC) codes with more flexible rates and better performance. The masking matrix of the highest‐rate code can first be constructed column by column to own the lowest decoding threshold. Then, an extension algorithm is proposed to obtain the masking matrices of lower‐rate codes with flexible rates. Finally, the base matrices with small amount of short cycles are designed and the parity‐check matrices of rate‐compatible QC‐LDPC codes are obtained through matrix extension. Simulations show that compared with the existing codes, the proposed codes have more flexible rates while achieving better performance.

Electronics Letters•Jul 31, 2018•4 citations
This paper proposes a finite-length quasi-cyclic low-density parity-check (QC-LDPC) code design framework based on protograph extrinsic information transfer (PEXIT) analysis, with the objective of minimizing the number of iterations required to meet a target error probability. First, the designEb/N0E_{b}/N_{0}Eb​/N0​is selected from channel-capacity considerations and is refined for finite-length operation by explicitly accounting for the block length and the target error requirement. Then, at the resultingEb/N0E_{b}/N_{0}Eb​/N0​, the mutual-information trajectory predicted by the PEXIT chart is exploited to track the evolution of the word error probability. Leveraging this estimate, we introduce a systematic greedy design rule that obviates exhaustive search by progressively removing edges from an initial base matrix subject to structural constraints, thereby markedly reducing the design complexity while improving convergence behavior in terms of the required iteration count.
In this letter, we present a design method to find good protograph-based low-density parity-check codes with the numbers of nonzero elements in the parity-check matrix and decoding iterations both strictly limited. We utilize the protograph-based extrinsic information transfer (PEXIT) analysis to evaluate the error performance and employ the differential evolution algorithm to devise a well-performed coding scheme. In particular, the number of iterations in the PEXIT analysis is set to a small value due to the limited iterations in the decoding process. Both numerical analyses and simulations verify that the resulting codes exhibit better performance than conventional code designs under the limitation of decoding complexity.
We introduce the protograph sieving method as a tool for optimization of moderate length Multi-Edge Type Quasi-Cyclic Low-Density Parity-Check (MET QC-LDPC)codes. The proposed method allows to improve code distance property with defined graph balanced cycles and construct MET-LDPC protograph for the code length in gap between Scattering PEXIT-chart and Covariance Evolution methods. We show that this approach improves code distance properties and achieves 0.2 dB gain in terms of block error rate (BLER)over the additive white Gaussian noise (AWGN)channel for information length of 600 bits and rate 1/3, at a target BLER of 10-6when compared to BG2 MET-LDPC code proposed at 5G standard.
To obtain efficient and pragmatic channel codes high signal-to-noise ratios (SNRs), an optimized construction of short and high rate protograph quasi-cyclic (QC) low-density parity-check (LDPC) codes is presented. Based on an optimized protograph template, the code framework is firstly produced by the extensions of the variable nodes. By enlarging the dimension of the sub-matrices related to the protograph framework, the base quasi-cyclic (QC) matrix is generated with required code rate and length. Then, the elements in the base matrix are split with even smaller square sub-matrices of the same row and column weights. In this procedure, a progressive edge growth (PEG) algorithm is employed to find the optimized positions of the QC submatrices, which brings larger girth for better code performance. Also the circulant offsets in all QC sub-matrices are optimally searched by a QC improved approximated cycle extrinsic message degree (QCI-ACE) algorithm, which improves the relationship of the unavoidable loops in the code's Tanner graph and thus it improves the error floor. Simulation results show that the codes produced by the proposed method demonstrate quite good bit error rate (BER) performance. In addition, they exhibit good properties of high spectrum efficiency by the high code rate, as well as the low complexity by the short code length. Therefore, the proposed code construction can be efficiently applied in the design of short and high rate protograph QC-LDPC codes with high rate and rational complexity.
To obtain efficient channel codes with high power efficiency at moderate signal-to-noise ratios (SNRs), an efficient high-rate protograph quasi-cyclic (QC) low-density parity-check (LDPC) codes is optimally constructed. By an optimized protograph template, the code framework is firstly produced by the extensions of the variable nodes. By enlarging the dimension of the sub-matrices related to the protograph framework, the base QC matrix template is generated with required code rate and length by the extrinsic information transfer (EXIT) chart for better decoding threshold. Then, the elements in the base matrix are split with even smaller square sub-matrices of the same row and column weights. In this procedure, a progressive-edge-growth (PEG) algorithm is employed to find the optimized positions of the QC sub-matrices to obtain larger girth for better error floor performance. Moreover, an asymptotic weight distribution (AWD) is employed to keep a low-code-error floor for the code. Also the circulant offsets in all QC sub-matrices are optimally searched by a QC oriented nested loop approximated cycle extrinsic message degree (QC-NLACE) algorithm, which improves the relationship of the unavoidable loops in the code's Tanner graph to cut the error floor. Simulation results show that the codes produced by the proposed method show quite good bit-error-rate (BER) performance. In addition, they exhibit good properties of high spectrum efficiency brought by the high code rate, and the low complexity by the short code length. Moreover, a series of different rate-compatible LDPC codes can be generated from the same protograph framework with some variable node extensions, which significantly eases the code design. Therefore, the proposed code construction can be efficiently applied in the optimal construction of high-rate and short-length rate-compatible QC-LDPC codes with a high data rate and rational complexity, which makes the codes extremely suited for use in new-generation power-constrained wireless communications.
In this article, we design finite-length irregular protograph-based quasi-cyclic (QC) low-density parity-check (LDPC) codes with good waterfall performance and low error floor. To achieve a low error floor, we eliminate a targeted set of dominant elementary trapping sets (ETS) £ in the Tanner graph of the code. For a given rate and girth, the codes are designed to be free of the largest set of problematic ETSs for a given block length, or to have the shortest block length while a given set of ETSs is avoided. The design is based on a search algorithm that identifies whether any instance of any structure within £ exists in the Tanner graph of the constructed code or not. The search algorithm performs this task with minimal complexity, making it feasible to construct practical codes by running the search algorithm a large number of times. Simulation results are provided to demonstrate the superior performance of designed codes compared to similar state-of-the-art irregular QC-LDPC codes.
An improved extension method based on protograph extrinsic information transfer (PEXIT) charts is proposed to design rate‐compatible quasi‐cyclic low‐density parity‐check (QC‐LDPC) codes with more flexible rates and better performance. The masking matrix of the highest‐rate code can first be constructed column by column to own the lowest decoding threshold. Then, an extension algorithm is proposed to obtain the masking matrices of lower‐rate codes with flexible rates. Finally, the base matrices with small amount of short cycles are designed and the parity‐check matrices of rate‐compatible QC‐LDPC codes are obtained through matrix extension. Simulations show that compared with the existing codes, the proposed codes have more flexible rates while achieving better performance.