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

International Symposium on Turbo Codes and Iterative Information Processing

Improved PEG construction of large girth QC-LDPC codes

Madiagne Diouf, David Declercq, M.P.C. Fossorier, Samuel Ouya, Bane V. Vasic

Published Sep 1, 2016• 20 citations
Publisher

Abstract

In this paper, we present an improvement of the PEG algorithm for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with large girth. We introduce the concept of PEG-undetectable cycles on the computation tree in the PEG algorithm for QC-LDPC codes and give a predictive method to avoid these undetected cycles. The aim is to select only the candidates that ensure the maximization of local girth for a code of girth g ≥ 10 and thus avoid a posteriori verification after the creation of a new edge i.e. keep the predictive philosophy of the PEG algorithm. The proposed method is applicable to both regular and irregular codes and also protograph type-I codes. Simulation results are presented to demonstrate the efficiency of our method in terms of minimum circulant permutation matrix pminand error performance.

DOI
10.1109/istc.2016.7593094

Related papers

Modified PEG algorithm for large girth Quasi-cyclic protograph LDPC codes

Xueqin Jiang, Moon Ho Lee, Hui-Ming Wang +2 more

For a given base graph, the protograph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the protograph corresponds to a quasi-cyclic (QC) protograph LDPC code. The girth of the QC protograph LDPC code is determined by the girth of the base graph and the permutation shifts. Progressive edge-growth (PEG) construction builds up a Tanner graph, or equivalently a parity-check matrix, for an LDPC code by maximizing the local girth at symbol nodes in a greedy algorithm. In this paper, we introduce a modified version of the PEG algorithm which can construct large girth base graph and determine the optimal permutation shifts, simultaneously, for QC protograph LDPC codes. Simulation results show that the QC protograph LDPC codes constructed by the proposed modified PEG algorithm have good frame error rate (FER) performance over the AWGN channel.

2012 International Conference on Computing, Networking and Communications (ICNC)•Feb 1, 2016•5 citations

Quasi-Cyclic Low-Density Parity-Check Codes Based on Progressive Cycle Growth Algorithm

Yuanhua Liu, Meiling Zhang, Niu Xin-Liang

Short cycles in the Tanner graph of a given LDPC code has negative effect on the performance of iterative decoding. To improve the performance, we presented an approach for constructing Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes whose associated Tanner graph has large girth and a small amount of short cycles. Each column block of the parity check matrix was designed by adding circulant permutation sub-matrices one after another, provided the current parity check matrix has minimal number of short cycles. The condition for the proposed QC-LDPC codes to have girth at least 6 was also analyzed. Regular and irregular QC-LDPC codes with various lengths and rates can be constructed. Simulations show that the proposed QC-LDPC codes have less short cycles and better performance than existing progressive edge growth based QC-LDPC codes.

International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)•Jul 1, 2016•1 citation

Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm

Xueqin Jiang, Han Hai, Hui-Ming Wang +1 more

For a given base graph, the lifted graph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the lifted graph corresponds to a quasi-cyclic (QC) protograph low-density parity-check (LDPC) code. The girth of the QC protograph LDPC code is determined by the girth of the base graph and the permutation shifts. In this paper, we first derive a lower bound on the lifting degree to achieve a large girth lifted graph. Then, motivated by the cycle searching and girth maximizing features of the progressive edge-growth (PEG) algorithm, we introduce the permutation shifts determining (PSD) PEG algorithm, which can construct large girth base graph and determine the optimal permutation shifts, simultaneously. It is shown that the computational complexity of PSD-PEG algorithm is much lower than that of the PEG algorithm and the PEG-QC algorithm for the same codeword length. Furthermore, we show that the PSD-PEG algorithm can also be used to construct nonbinary QC protograph LDPC codes without low weight codes. Simulation results show that the binary and nonbinary QC protograph LDPC codes constructed by the PSD-PEG algorithm have good bit error rate performance and frame error rate performance over the additive white Gaussian noise channel.

IEEE Access•Jan 1, 2017•22 citations

A time-saving algorithm for constructing QC-LDPC codes based on PEG algorithm

Ping Gong, Huang Liqun

We propose a new algorithm based on PEG algorithm to construct high-girth quasi-cyclic low-density parity check (QC-LDPC) codes. Before our improved algorithm in introduction, we depict the general algorithm based on PEG algorithm to construct QC - LDPC code, if necessary to eliminate the short cycles, that would bring in cycles-search. When code length of basic matrix is not too long, the algorithm is feasible, but with the code length growth, cycles-search will bring large of calculation and time-consuming sharply. Therefore we put forward an improved method by using the specific relation of basic matrix rows to replace traditional cycles-search, effectively eliminates short cycles, and largely reduces the time complexity at the same time. Through the simulation analysis, the performance can also be comparable with random constructed LDPC codes.

International Conference on Consumer Electronics, Communications and Networks (CECNet)•Apr 1, 2011•1 citation

An Improved Construction Method of QC-LDPC Codes Based on the PEG Algorithm

Liqun Huang, Yuliang Wang, Ping Gong

Due to quasi-cyclic structure of parity-check matrices, Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes reduce hardware requirements, and thus they have a higher practical value than random LDPC codes. This paper proposes an improved construction method of QC-LDPC based on PEG Algorithm, and the girth of the QC-LDPC codes has an increase of 2. Firstly, a base matrix is generated by the PEG algorithm, and then the base matrix is expanded using the unit circle permutation matrix, at the same time, the short loop of the base matrix is eliminated. This approach has the advantages of the PEG algorithm and the QC-LDPC codes, and simulation results show that bit error rate (BER) performance of the QC-LDPC codes presented in this paper is the same as or exceeds the one of randomly constructed LDPC codes.

Pacific-Asia Conference on Circuits, Communications and Systems•Jul 1, 2011•4 citations

Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes

Vasiliy S. Usatyuk, Ilya Vorobyev

We present a simulated annealing method that construct high-girth quasi-cyclic low-density parity check (QC-LDPC) codes. The proposed method is applicable to both regular and irregular protograph codes. The method show improvement in term of minimal circulant size compare with previous described methods: Hill-Climbing and improved PEG. Simulated results are presented to demonstrate performance gain of proposed construction method in error-floor region under base graph 2 (BG2) using 5G eMBB standard length adaption method.

International Conference on Telecommunications and Signal Processing (TSP)•Jul 1, 2018•23 citations
In this paper, we present an improvement of the PEG algorithm for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with large girth. We introduce the concept of PEG-undetectable cycles on the computation tree in the PEG algorithm for QC-LDPC codes and give a predictive method to avoid these undetected cycles. The aim is to select only the candidates that ensure the maximization of local girth for a code of girth g ≥ 10 and thus avoid a posteriori verification after the creation of a new edge i.e. keep the predictive philosophy of the PEG algorithm. The proposed method is applicable to both regular and irregular codes and also protograph type-I codes. Simulation results are presented to demonstrate the efficiency of our method in terms of minimum circulant permutation matrix pminand error performance.
For a given base graph, the protograph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the protograph corresponds to a quasi-cyclic (QC) protograph LDPC code. The girth of the QC protograph LDPC code is determined by the girth of the base graph and the permutation shifts. Progressive edge-growth (PEG) construction builds up a Tanner graph, or equivalently a parity-check matrix, for an LDPC code by maximizing the local girth at symbol nodes in a greedy algorithm. In this paper, we introduce a modified version of the PEG algorithm which can construct large girth base graph and determine the optimal permutation shifts, simultaneously, for QC protograph LDPC codes. Simulation results show that the QC protograph LDPC codes constructed by the proposed modified PEG algorithm have good frame error rate (FER) performance over the AWGN channel.
Short cycles in the Tanner graph of a given LDPC code has negative effect on the performance of iterative decoding. To improve the performance, we presented an approach for constructing Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes whose associated Tanner graph has large girth and a small amount of short cycles. Each column block of the parity check matrix was designed by adding circulant permutation sub-matrices one after another, provided the current parity check matrix has minimal number of short cycles. The condition for the proposed QC-LDPC codes to have girth at least 6 was also analyzed. Regular and irregular QC-LDPC codes with various lengths and rates can be constructed. Simulations show that the proposed QC-LDPC codes have less short cycles and better performance than existing progressive edge growth based QC-LDPC codes.
For a given base graph, the lifted graph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the lifted graph corresponds to a quasi-cyclic (QC) protograph low-density parity-check (LDPC) code. The girth of the QC protograph LDPC code is determined by the girth of the base graph and the permutation shifts. In this paper, we first derive a lower bound on the lifting degree to achieve a large girth lifted graph. Then, motivated by the cycle searching and girth maximizing features of the progressive edge-growth (PEG) algorithm, we introduce the permutation shifts determining (PSD) PEG algorithm, which can construct large girth base graph and determine the optimal permutation shifts, simultaneously. It is shown that the computational complexity of PSD-PEG algorithm is much lower than that of the PEG algorithm and the PEG-QC algorithm for the same codeword length. Furthermore, we show that the PSD-PEG algorithm can also be used to construct nonbinary QC protograph LDPC codes without low weight codes. Simulation results show that the binary and nonbinary QC protograph LDPC codes constructed by the PSD-PEG algorithm have good bit error rate performance and frame error rate performance over the additive white Gaussian noise channel.
We propose a new algorithm based on PEG algorithm to construct high-girth quasi-cyclic low-density parity check (QC-LDPC) codes. Before our improved algorithm in introduction, we depict the general algorithm based on PEG algorithm to construct QC - LDPC code, if necessary to eliminate the short cycles, that would bring in cycles-search. When code length of basic matrix is not too long, the algorithm is feasible, but with the code length growth, cycles-search will bring large of calculation and time-consuming sharply. Therefore we put forward an improved method by using the specific relation of basic matrix rows to replace traditional cycles-search, effectively eliminates short cycles, and largely reduces the time complexity at the same time. Through the simulation analysis, the performance can also be comparable with random constructed LDPC codes.
Due to quasi-cyclic structure of parity-check matrices, Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes reduce hardware requirements, and thus they have a higher practical value than random LDPC codes. This paper proposes an improved construction method of QC-LDPC based on PEG Algorithm, and the girth of the QC-LDPC codes has an increase of 2. Firstly, a base matrix is generated by the PEG algorithm, and then the base matrix is expanded using the unit circle permutation matrix, at the same time, the short loop of the base matrix is eliminated. This approach has the advantages of the PEG algorithm and the QC-LDPC codes, and simulation results show that bit error rate (BER) performance of the QC-LDPC codes presented in this paper is the same as or exceeds the one of randomly constructed LDPC codes.
We present a simulated annealing method that construct high-girth quasi-cyclic low-density parity check (QC-LDPC) codes. The proposed method is applicable to both regular and irregular protograph codes. The method show improvement in term of minimal circulant size compare with previous described methods: Hill-Climbing and improved PEG. Simulated results are presented to demonstrate performance gain of proposed construction method in error-floor region under base graph 2 (BG2) using 5G eMBB standard length adaption method.