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 East-West Design & Test Symposium (EWDTS)

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

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

Published Sep 1, 2019• 3 citations
Publisher

Abstract

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.

DOI
10.1109/ewdts.2019.8884381

Related papers

Construction of Length and Rate Adaptive MET QC-LDPC Codes by Cyclic Group Decomposition

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

We introduce a quasi-cyclic construction method for improving performance of length and rate adaptive Multi-Edge Type LDPC (MET-LDPC)codes below Block Error Rate (BLER)10-5Proposed method allows to construct nested code families with a code length variability based on 5G eMBB modular lifting of Base Graph 2. Constructed codes are optimized by code distance and graph properties. Simulation results under 50 iterations of sum-product decoding over an AWGN channel with QPSK modulation are provided for comparing to 5G eMBB codes. It shows near the same performance for information length , 0.1 - 0.3 dB coding gain on under rate 1/3, and coding gain around 0.3 dB under rate 1/5.

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

Interleaved Cyclic Group Decomposition Length Adaptive MET QC-LDPC Codes

German Svistunov, Vasiliy S. Usatyuk

We introduce quasi-cyclic extension method for performance improving of the length adaptive Multi-Edge Type (MET) Quasi-cyclic LDPC (QC-LDPC) codes below the Block Error Rate (BLER) 10-5. Proposed method allows to construct MET QC-LDPC Codes for variable code length with the modular lifting of 5G eMBB Base Graph 2. Simulation results under 50 iterations of sum-product decoding over an AWGN channel with QPSK modulation are provided. It shows near same performance for information length k600 compared with 5G eMBB codes.

IEEE International Black Sea Conference on Communications and Networking•Jun 1, 2019•1 citation

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 High Performance Block and Convolutional Multi-Edge Type QC-LDPC codes

Vasiliy S. Usatyuk, Ilya Vorobyev

We present code sieving method for construction of long-length high performance Block and Convolutional Multi-Edge Type QC-LDPC codes (MET QC-LDPCC) under the fixed point (Quantized) reduced complexity box-plus (QRCBP) decoder. Proposed method use iterative decoding threshold protograph sieving and simulated annealing method for QC lifting with cycles EMD maximization. Using proposed method we construct base matrix of MET-LDPC code with size 92 20, maximal column weight 17, with weight one circulants, code rate 0.8, 2 variable nodes punctured which have iterative decoding threshold Eb/No = 2.333 dB under 200 iterations of QRCBP over an AWGN channel with QPSK modulation on Bit Error Rate below 10-, 0.289 dB from Shannon limit. Simulation results of Block with code length N = 261924 and MET QC-LDPCC codes, equivalent block length N = 785772 constructed using simulated annealing lifting of base matrix under 32 iterations of QRCBP show Eb/No = 2.56dB, Eb/No = 2.478dB below BER10-15, respectively. Cole's importance sampling under QRCBP show that proposed codes error-floor BER ≈ 10-16.

International Conference on Telecommunications and Signal Processing (TSP)•Jul 1, 2019•4 citations

Construction of Regular Quasi-Cyclic Protograph LDPC Codes Based on Vandermonde Matrices

Nicholas Bonello, Sheng Chen, Lajos Hanzo

In this paper, we investigate the attainable performance of quasi-cyclic (QC) protograph low-density parity-check (LDPC) codes for transmission over both additive white Gaussian noise and uncorrelated Rayleigh channels. The presented codes are constructed using the Vandermonde matrix and thus have a girth of at least six in their corresponding Tanner graph. Furthermore, they also benefit from both low-complexity encoding and decoding, low memory requirements, as well as hardware-friendly implementations. Our simulation results demonstrate that the advantages offered by this family of QC protograph LDPC codes accrue with no compromise in the attainable bit error ratio (BER) and block error ratio (BLER) performances. In fact, it is also shown that despite their implementational benefits, the proposed codes exhibit slight BER/BLER gains when compared to some of their more complex counterparts of the same length.

IEEE Transactions on Vehicular Technology•Jul 1, 2008•37 citations

Construction of Regular Quasi-Cyclic Protograph LDPC codes based on Vandermonde Matrices

Nicholas Bonello, Sheng Chen, Lajos Hanzo

In this contribution, we investigate the attainable performance of quasi-cyclic (QC) protograph low-density parity-check (LDPC) codes for transmission over both Additive White Gaussian noise (AWGN) and uncorrelated Rayleigh channels. The codes presented are constructed using the Vandermonde matrix and benefit from both low- complexity encoding and decoding, low memory requirements as well as hardware-friendly implementations. Our simulation results demonstrate that the advantages offered by this family of QC protograph LDPC codes accrue without any compromise in the attainable bit error ratio (BER) and block error ratio (BER) performance. In fact, it is also shown that despite their implementational benefits, the proposed codes exhibit slight BER/BLER gains when compared to some of their more complex counterparts of the same length.

IEEE Vehicular Technology Conference•Sep 1, 2008•1 citation
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.
We introduce a quasi-cyclic construction method for improving performance of length and rate adaptive Multi-Edge Type LDPC (MET-LDPC)codes below Block Error Rate (BLER)10-5Proposed method allows to construct nested code families with a code length variability based on 5G eMBB modular lifting of Base Graph 2. Constructed codes are optimized by code distance and graph properties. Simulation results under 50 iterations of sum-product decoding over an AWGN channel with QPSK modulation are provided for comparing to 5G eMBB codes. It shows near the same performance for information length , 0.1 - 0.3 dB coding gain on under rate 1/3, and coding gain around 0.3 dB under rate 1/5.
We introduce quasi-cyclic extension method for performance improving of the length adaptive Multi-Edge Type (MET) Quasi-cyclic LDPC (QC-LDPC) codes below the Block Error Rate (BLER) 10-5. Proposed method allows to construct MET QC-LDPC Codes for variable code length with the modular lifting of 5G eMBB Base Graph 2. Simulation results under 50 iterations of sum-product decoding over an AWGN channel with QPSK modulation are provided. It shows near same performance for information length k600 compared with 5G eMBB codes.
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.
We present code sieving method for construction of long-length high performance Block and Convolutional Multi-Edge Type QC-LDPC codes (MET QC-LDPCC) under the fixed point (Quantized) reduced complexity box-plus (QRCBP) decoder. Proposed method use iterative decoding threshold protograph sieving and simulated annealing method for QC lifting with cycles EMD maximization. Using proposed method we construct base matrix of MET-LDPC code with size 92 20, maximal column weight 17, with weight one circulants, code rate 0.8, 2 variable nodes punctured which have iterative decoding threshold Eb/No = 2.333 dB under 200 iterations of QRCBP over an AWGN channel with QPSK modulation on Bit Error Rate below 10-, 0.289 dB from Shannon limit. Simulation results of Block with code length N = 261924 and MET QC-LDPCC codes, equivalent block length N = 785772 constructed using simulated annealing lifting of base matrix under 32 iterations of QRCBP show Eb/No = 2.56dB, Eb/No = 2.478dB below BER10-15, respectively. Cole's importance sampling under QRCBP show that proposed codes error-floor BER ≈ 10-16.
In this paper, we investigate the attainable performance of quasi-cyclic (QC) protograph low-density parity-check (LDPC) codes for transmission over both additive white Gaussian noise and uncorrelated Rayleigh channels. The presented codes are constructed using the Vandermonde matrix and thus have a girth of at least six in their corresponding Tanner graph. Furthermore, they also benefit from both low-complexity encoding and decoding, low memory requirements, as well as hardware-friendly implementations. Our simulation results demonstrate that the advantages offered by this family of QC protograph LDPC codes accrue with no compromise in the attainable bit error ratio (BER) and block error ratio (BLER) performances. In fact, it is also shown that despite their implementational benefits, the proposed codes exhibit slight BER/BLER gains when compared to some of their more complex counterparts of the same length.
In this contribution, we investigate the attainable performance of quasi-cyclic (QC) protograph low-density parity-check (LDPC) codes for transmission over both Additive White Gaussian noise (AWGN) and uncorrelated Rayleigh channels. The codes presented are constructed using the Vandermonde matrix and benefit from both low- complexity encoding and decoding, low memory requirements as well as hardware-friendly implementations. Our simulation results demonstrate that the advantages offered by this family of QC protograph LDPC codes accrue without any compromise in the attainable bit error ratio (BER) and block error ratio (BER) performance. In fact, it is also shown that despite their implementational benefits, the proposed codes exhibit slight BER/BLER gains when compared to some of their more complex counterparts of the same length.