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

REV Journal on Electronics and Communications

Constructing High-Rate QC-LDPC Codes with Large-Girth based on Shortened Array Codes

Xu Chen, Francis C. M. Lau

Published Dec 31, 2011• 0 citations
Publisher

Abstract

In this paper, we aim at constructing high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth-10 based on shortened array codes. Our first contribution is the derivation of analytic results on the maximum number of columns for shortened array codes of different girths. Then, inspired by the analysis, we propose a code construction method for column-weight-three codes. We further compare the minimum length and the error performance of the column-weight-three codes constructed by the proposed algorithm and those found by the conventional greedy construction algorithm. We show that the proposed method is more effective than the conventional greedy algorithm in the sense that the minimum length of the codes constructed using the proposed method to achieve different code rates is comparative or much shorter than those constructed using the greedy construction.

DOI
10.21553/rev-jec.22

Related papers

Construction of high-rate QC-LDPC codes

Xu Chen, Francis C. M. Lau

In this paper, we construct high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth-10 based on shortened array codes. First, we derive analytic results on the maximum number of columns for shortened array codes of different girths. A code construction method inspired by the analysis is proposed for column-weight-three codes and is compared with the conventional greedy construction algorithm. We show that the proposed method is more effective than the conventional greedy algorithm in the sense that the minimum length of the codes constructed using our proposed method to achieve different code rates is comparative or much shorter than those constructed using the greedy construction.

International Conference on Advanced Technologies for Communications•Aug 1, 2011•3 citations

Construction of High-Rate Regular Quasi-Cyclic LDPC Codes Based on Cyclic Difference Families

Hosung Park, Seokbeom Hong, Jong‐Seon No +1 more

For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to have short cycles. Also, the existing high-rate quasi-cyclic (QC) LDPC codes can be constructed only for very restricted code parameters. In this paper, based on special classes of cyclic difference families, we propose a new construction method of high-rate regular QC LDPC codes having parity-check matrices consisting of a single row of circulants with column-weight 3 or 4. The proposed QC LDPC codes can be constructed for various code rates and lengths including the minimum achievable length for given column-weight and design rate under girth 6. It is observed that the parity-check matrices of the proposed QC LDPC codes have full rank for column-weight 3 and just one redundant row for column-weight 4. It is shown that the error correcting performance of the proposed QC LDPC codes of short and moderate lengths is almost the same as that of the existing ones through numerical analysis.

arXiv:1211.3828•IEEE Transactions on Communications•Jul 16, 2013•33 citations

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

Very Large Girth Column-weight two Quasi-cyclic LDPC Codes

Gabofetswe Malema, Michael John Liebelt

In this paper a modified bit-filling algorithm is used for constructing column-weight two quasi-cyclic low-density parity-check codes with large girths. Code rows are divided into groups. A column is connected to two rows from different groups, which are apart by at least a specified minimum length. Rows that meet the minimum length are searched sequentially. Group rows are connected to consecutive columns resulting in a cyclic structure in the code matrix. Larger codes can be obtained by using larger row groups. Compared to other methods, the algorithm provides an easy and fast way to construct codes of a wide range of rates, girths and lengths. Constructed codes show good bit error rate performance. They are also easily implementable in hardware compared to those obtained using the original bit filling algorithm

International Conference on Signal Processing•Jan 1, 2006•1 citation

A base matrix method to construct column weight 3 quasi-cyclic LDPC codes with high girth

Abhishek Kalsi, Ambar Bajpai, Lunchakorn Wuttisittikulkij +1 more

This article presents a simple, less computational complexity method for constructing exponent matrix (3, K) of girth 8, 10 and 12 of quasi-cyclic low-density parity-check codes (QC-LDPC) based on generation of base matrix. The construction of code deals with generation of base matrix by a simple algorithm and element wise element method for girth 8, while only element wise element method for girth 10 and 12. These methods are flexible for block-column length K. The simulations are shown in comparison with some existing appreciable work.

International Conference on Electronics, Information, and Communication (ICEIC)•Jan 1, 2016•2 citations

On the Construction of Multitype Quasi-Cyclic Low-Density Parity-Check Codes With Different Girth and Length

Farzaneh Abedi, Mohammad Gholami

Multitype quasi-cyclic (QC) low-density parity-check (LDPC) codes are a class of protograph LDPC codes lifted cyclically from protographs with multiple edges, represented by two weight and slope matrices. For a given weight-matrix, an approach is proposed to find the maximum-achievable girth$g_{\max }$of the corresponding multitype QC-LDPC codes by some inevitable chains having less complexity than the existing methods. This advantage leads to some new patterns of the weight matrices such that the corresponding codes have some improvements in terms of the maximum-achievable girths or the minimum-distance upper-bounds. In continue, for a given weight-matrix with maximum-achievable girth$g_{\max }$, some slope-matrices are constructed by a depth-first search algorithm for which the corresponding multitype QC-LDPC codes with even girth$g$,$g\le g_{\max }$, have smaller lengths, higher rates, or larger minimum-distances than the state-of-the-art achievements. Simulation results show that the constructed codes have some error-rate advantages than PEG, random-like, CCSDS, and 802.11n/ac IEEE standard LDPC codes.

IEEE Access•Jan 1, 2021•2 citations
In this paper, we aim at constructing high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth-10 based on shortened array codes. Our first contribution is the derivation of analytic results on the maximum number of columns for shortened array codes of different girths. Then, inspired by the analysis, we propose a code construction method for column-weight-three codes. We further compare the minimum length and the error performance of the column-weight-three codes constructed by the proposed algorithm and those found by the conventional greedy construction algorithm. We show that the proposed method is more effective than the conventional greedy algorithm in the sense that the minimum length of the codes constructed using the proposed method to achieve different code rates is comparative or much shorter than those constructed using the greedy construction.
In this paper, we construct high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth-10 based on shortened array codes. First, we derive analytic results on the maximum number of columns for shortened array codes of different girths. A code construction method inspired by the analysis is proposed for column-weight-three codes and is compared with the conventional greedy construction algorithm. We show that the proposed method is more effective than the conventional greedy algorithm in the sense that the minimum length of the codes constructed using our proposed method to achieve different code rates is comparative or much shorter than those constructed using the greedy construction.
For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to have short cycles. Also, the existing high-rate quasi-cyclic (QC) LDPC codes can be constructed only for very restricted code parameters. In this paper, based on special classes of cyclic difference families, we propose a new construction method of high-rate regular QC LDPC codes having parity-check matrices consisting of a single row of circulants with column-weight 3 or 4. The proposed QC LDPC codes can be constructed for various code rates and lengths including the minimum achievable length for given column-weight and design rate under girth 6. It is observed that the parity-check matrices of the proposed QC LDPC codes have full rank for column-weight 3 and just one redundant row for column-weight 4. It is shown that the error correcting performance of the proposed QC LDPC codes of short and moderate lengths is almost the same as that of the existing ones through numerical analysis.
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.
In this paper a modified bit-filling algorithm is used for constructing column-weight two quasi-cyclic low-density parity-check codes with large girths. Code rows are divided into groups. A column is connected to two rows from different groups, which are apart by at least a specified minimum length. Rows that meet the minimum length are searched sequentially. Group rows are connected to consecutive columns resulting in a cyclic structure in the code matrix. Larger codes can be obtained by using larger row groups. Compared to other methods, the algorithm provides an easy and fast way to construct codes of a wide range of rates, girths and lengths. Constructed codes show good bit error rate performance. They are also easily implementable in hardware compared to those obtained using the original bit filling algorithm
This article presents a simple, less computational complexity method for constructing exponent matrix (3, K) of girth 8, 10 and 12 of quasi-cyclic low-density parity-check codes (QC-LDPC) based on generation of base matrix. The construction of code deals with generation of base matrix by a simple algorithm and element wise element method for girth 8, while only element wise element method for girth 10 and 12. These methods are flexible for block-column length K. The simulations are shown in comparison with some existing appreciable work.
Multitype quasi-cyclic (QC) low-density parity-check (LDPC) codes are a class of protograph LDPC codes lifted cyclically from protographs with multiple edges, represented by two weight and slope matrices. For a given weight-matrix, an approach is proposed to find the maximum-achievable girthgmax⁡g_{\max }gmax​of the corresponding multitype QC-LDPC codes by some inevitable chains having less complexity than the existing methods. This advantage leads to some new patterns of the weight matrices such that the corresponding codes have some improvements in terms of the maximum-achievable girths or the minimum-distance upper-bounds. In continue, for a given weight-matrix with maximum-achievable girthgmax⁡g_{\max }gmax​, some slope-matrices are constructed by a depth-first search algorithm for which the corresponding multitype QC-LDPC codes with even girthggg,g≤gmax⁡g\le g_{\max }g≤gmax​, have smaller lengths, higher rates, or larger minimum-distances than the state-of-the-art achievements. Simulation results show that the constructed codes have some error-rate advantages than PEG, random-like, CCSDS, and 802.11n/ac IEEE standard LDPC codes.