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 Communications Letters

QC-LDPC Codes with Girth Eight Based on Independent Row-Column Mapping Sequence

Lei Wang, Xing Zhang, Feng Yu, Yao-Xian Fu, Yingguan Wang

Published Oct 10, 2013• 6 citations
Publisher

Abstract

Quasi-cyclic low-density parity-check (QC-LDPC) codes are known to have algebraic structure, which suits hardware implementation. However, low girth makes their performances worse than random structured LDPC codes. Based on independent row-column mapping sequence, this work proposed a generalized method of constructing QC-LDPC codes with girth eight, which enlarges the class of girth eight QC-LDPC codes to a fairly general series. Simulation results show that the bit error rate of the constructed codes is close to that of progressive edge growth (PEG) based QC-LDPC codes under iterative decoding.

DOI
10.1109/lcomm.2013.092813.131581

Related papers

Constructions of Type-II QC-LDPC Codes With Girth Eight from Sidon Sequence

Guohua Zhang, Yulin Hu, Yi Fang +1 more

In this paper, we consider the constructions of type-II quasi-cyclic (QC) low-density parity-check (LDPC) codes with girth eight from a Sidon sequence. We first derive the necessary and sufficient conditions guaranteeing a girth-eight type-II QC-LDPC code. By combining these conditions with the concept of the Sidon sequence, three classes of type-II QC-LDPC codes are subsequently proposed with girth eight. To the best of our knowledge, the second and the third classes we proposed are the first series of systematic and algebraic constructions for the girth-eight type-II QC-LDPC codes that have rates being greater than a half and, at the same time, have distance upper bounds being not limited to 12. Via simulations, we show the promising performance of the proposed type-II QC-LDPC codes with girth eight. In addition, a set of general bounds and explicit/random constructions without using a Sidon sequence are also presented for the type-II QC-LDPC codes with girth six or eight. We observe that the proposed codes perform better than or equally well as the random QC-LDPC codes from PEG and quadr.-congr. methods, while the novel codes possess both highly structured parity-check matrices and very flexible choices in circulant size.

IEEE Transactions on Communications•Feb 25, 2019•22 citations

The Design of Structured Low-Density Parity-Check Codes With Large Girth

Jing Long

This paper,based on algebra and graph,proposes a method for constructing structured low-density parity-check(LDPC) codes.In this method,the authors design a connected graph with three kinds of special path to ensure that the Tanner graph of the parity check matrix mapped from the connected graph is without short cycles.The construction method results in two classes of(3,k)-regular quasi-cyclic LDPC codes with girth 8 and 12 respectively.Furthermore,by extending this construction method,two classes of LDPC codes with column weight 2,whose girths are respectively 16 and 24,can be obtained.The simulation studies show that these codes can achieve better performance than randomly constructed regular LDPC codes over AWGN channels with iterative decoding.At the BER of 10-5,the new proposed(3,6)-regular(4356,2205) QC-LDPC code performs 1.48dB from the Shannon limit.Moreover,it outperforms the random regular LDPC code of comparable parameters by 0.1dB.For the new proposed structured LDPC codes with column weight 2,they can achieve about 2dB coding gains with respect to the random regular LDPC codes with similar block lengths and code rates.

Chinese Journal of Computers•Jan 1, 2007•1 citation

Construction of Girth-Eight QC-LDPC Codes from Greatest Common Divisor

Guohua Zhang, Rong Xia Sun, Xinmei Wang

For any column weight J and any row weight L, a novel framework is proposed such that a girth-eight (J,L) quasi-cyclic low-density parity-check (QC-LDPC) code with any block length above a lower bound can be constructed via a simple inequality in terms of greatest common divisor (GCD). The main advantage is that the construction of a class of (J,L) girth-eight QC-LDPC codes is transformed into a rather simple task, searching for J integers satisfying the so-called GCD constraint for L. Combining the new method with masking matrices, a class of type-1 QC-LDPC codes is presented with girth at least eight. Simulation results show that the type-1 codes perform better than the random QC-LDPC codes and quadratic-congruence-based QC-LDPC codes for moderate block lengths and low code rates.

IEEE Communications Letters•Jan 2, 2013•47 citations

New quasi-cyclic LDPC codes with girth at least eight based on Sidon sequences

Guohua Zhang, Rong Xia Sun, Xinmei Wang

A new family of quasi-cyclic low-density parity-check (LDPC) codes of girth at least eight is explicitly constructed from Sidon sequences. These codes can be encoded using simple shift-registers. Furthermore, for short to moderate lengths these quasi-cyclic codes perform close to random progressive edge-growth (PEG) LDPC codes in terms of bit-error probability and block-error probability, collectively.

International Symposium on Turbo Codes and Iterative Information Processing•Aug 1, 2012•20 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

Flexible Construction of High-Girth QC-LDPC Codes

Gabofetswe Malema

This article presents a highly flexible method for constructing high-girth quasi-cyclic low-density parity-check (QC-LDPC) codes. The proposed algorithm constructs a Tanner graph formed by connecting groups of rows (check nodes) and columns (variable nodes) of the constructed code. To obtain a sub-matrix structure, rows and columns are divided into groups of equal sizes. Rows and columns in a group are connected in their numerical (positional) order to obtain a cyclic structure. Connected rows and columns must satisfy the desired minimum cycle length. We present conditions that guarantee desired girths. The proposed algorithm is by far more flexible in constructing a wide range (rates and lengths) of regular and irregular QC-LDPC codes compared to existing methods. The algorithm, which has linear complexity with respect to the number of rows or columns, provides an easy and fast way to construct QC-LDPC codes. Constructed codes show good bit error rate performances.

International journal of computer science and applications•Aug 1, 2012•2 citations
Quasi-cyclic low-density parity-check (QC-LDPC) codes are known to have algebraic structure, which suits hardware implementation. However, low girth makes their performances worse than random structured LDPC codes. Based on independent row-column mapping sequence, this work proposed a generalized method of constructing QC-LDPC codes with girth eight, which enlarges the class of girth eight QC-LDPC codes to a fairly general series. Simulation results show that the bit error rate of the constructed codes is close to that of progressive edge growth (PEG) based QC-LDPC codes under iterative decoding.
In this paper, we consider the constructions of type-II quasi-cyclic (QC) low-density parity-check (LDPC) codes with girth eight from a Sidon sequence. We first derive the necessary and sufficient conditions guaranteeing a girth-eight type-II QC-LDPC code. By combining these conditions with the concept of the Sidon sequence, three classes of type-II QC-LDPC codes are subsequently proposed with girth eight. To the best of our knowledge, the second and the third classes we proposed are the first series of systematic and algebraic constructions for the girth-eight type-II QC-LDPC codes that have rates being greater than a half and, at the same time, have distance upper bounds being not limited to 12. Via simulations, we show the promising performance of the proposed type-II QC-LDPC codes with girth eight. In addition, a set of general bounds and explicit/random constructions without using a Sidon sequence are also presented for the type-II QC-LDPC codes with girth six or eight. We observe that the proposed codes perform better than or equally well as the random QC-LDPC codes from PEG and quadr.-congr. methods, while the novel codes possess both highly structured parity-check matrices and very flexible choices in circulant size.
This paper,based on algebra and graph,proposes a method for constructing structured low-density parity-check(LDPC) codes.In this method,the authors design a connected graph with three kinds of special path to ensure that the Tanner graph of the parity check matrix mapped from the connected graph is without short cycles.The construction method results in two classes of(3,k)-regular quasi-cyclic LDPC codes with girth 8 and 12 respectively.Furthermore,by extending this construction method,two classes of LDPC codes with column weight 2,whose girths are respectively 16 and 24,can be obtained.The simulation studies show that these codes can achieve better performance than randomly constructed regular LDPC codes over AWGN channels with iterative decoding.At the BER of 10-5,the new proposed(3,6)-regular(4356,2205) QC-LDPC code performs 1.48dB from the Shannon limit.Moreover,it outperforms the random regular LDPC code of comparable parameters by 0.1dB.For the new proposed structured LDPC codes with column weight 2,they can achieve about 2dB coding gains with respect to the random regular LDPC codes with similar block lengths and code rates.
For any column weight J and any row weight L, a novel framework is proposed such that a girth-eight (J,L) quasi-cyclic low-density parity-check (QC-LDPC) code with any block length above a lower bound can be constructed via a simple inequality in terms of greatest common divisor (GCD). The main advantage is that the construction of a class of (J,L) girth-eight QC-LDPC codes is transformed into a rather simple task, searching for J integers satisfying the so-called GCD constraint for L. Combining the new method with masking matrices, a class of type-1 QC-LDPC codes is presented with girth at least eight. Simulation results show that the type-1 codes perform better than the random QC-LDPC codes and quadratic-congruence-based QC-LDPC codes for moderate block lengths and low code rates.
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.
This article presents a highly flexible method for constructing high-girth quasi-cyclic low-density parity-check (QC-LDPC) codes. The proposed algorithm constructs a Tanner graph formed by connecting groups of rows (check nodes) and columns (variable nodes) of the constructed code. To obtain a sub-matrix structure, rows and columns are divided into groups of equal sizes. Rows and columns in a group are connected in their numerical (positional) order to obtain a cyclic structure. Connected rows and columns must satisfy the desired minimum cycle length. We present conditions that guarantee desired girths. The proposed algorithm is by far more flexible in constructing a wide range (rates and lengths) of regular and irregular QC-LDPC codes compared to existing methods. The algorithm, which has linear complexity with respect to the number of rows or columns, provides an easy and fast way to construct QC-LDPC codes. Constructed codes show good bit error rate performances.