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 Access

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

Farzaneh Abedi, Mohammad Gholami

Published Jan 1, 2021• 2 citations
Publisher

Abstract

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.

DOI
10.1109/access.2021.3071846

Related papers

Design of Multiple-Edge Protographs for QC LDPC Codes Avoiding Short Inevitable Cycles

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

There have been lots of efforts on the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes with large girth. However, most of them focus on protographs with single edges and little research has been done for the construction of QC LDPC codes lifted from protographs with multiple (i.e., parallel) edges. Compared to single-edge protographs, multiple-edge protographs have benefits such that QC LDPC codes lifted from them can potentially have larger minimum Hamming distance. In this paper, all subgraph patterns of multiple-edge protographs, which prevent QC LDPC codes from having large girth by inducing inevitable cycles, are fully investigated based on a graph-theoretic approach. By using combinatorial designs, a systematic construction method of multiple-edge protographs is proposed for regular QC LDPC codes with girth at least 12 and another method is proposed for regular QC LDPC codes with girth at least 14. Moreover, a construction algorithm of QC LDPC codes based on certain liftings of multiple-edge protographs is proposed and it is shown that the resulting QC LDPC codes have larger upper bounds on the minimum Hamming distance than those lifted from single-edge protographs. Simulation results are provided to compare the performance of the proposed QC LDPC codes with progressive edge-growth (PEG) LDPC codes and with PEG QC LDPC codes.

arXiv:1210.3906•IEEE Transactions on Information Theory•Jun 14, 2013•31 citations

Some explicit constructions of type-II, III, IV, V QCLDPC codes with girth 6

Farzaneh Abedi, Mohammad Gholami

Multi-type quasi-cyclic (QC) low-density parity-check (LDPC) codes can be considered as multiple-edge protograph QC-LDPC codes having some advantages in the minimum Hamming distance bound over single-edge protograph codes or type-I QC-LDPC codes when the base matrices have the same size. In this paper, we investigate a class of multi-type QC-LDPC codes whose parity-check matrices contain just one blockrow of circulants and we obtain the generator matrix of such codes in general form. Using the permutation arrays and defining injection arrays, we present a new approach to construct a class of high-rate type-I QC-LDPC codes with girth 6 from the constructed 4-cycle free multi-type QC-LDPC codes. In continue, for 2 ≤ w ≤ 6, some type-w QC-LDPC codes with girth 6 are constructed explicitly such that the constructed codes are flexible in terms of rate and length. To the best of our knowledge, for w = 5,6, this is the first paper which deals with the explicit construction of type-w QC-LDPC codes with girth 6 and high rates. Moreover, for w = 3,4, the constructed type-w QC-LDPC codes have better (6,8)-cycle multiplicities than the codes with minimum achievable length recently constructed by cyclic difference families (CDFs). Simulation results show that the binary and non-binary constructed codes outperform the constituent underlying QC-LDPC codes.

China Communications•May 1, 2020•5 citations

Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than 121212

Sunghwan Kim, Jong‐Seon No, Habong Chung +1 more

A quasi-cyclic (QC) low-density parity-check (LDPC) code can be viewed as the protograph code with circulant permutation matrices (or circulants). In this correspondence, we find all the subgraph patterns of protographs of QC LDPC codes having inevitable cycles of length 2i, i = 6, 7, 8, 9,10, i.e., the cycles that always exist regardless of the shift values of circulants. It is also derived that if the girth of the protograph is 2g, g > 2, its protograph code cannot have the inevitable cycles of length smaller than 6g. Based on these subgraph patterns, we propose new combinatorial construction methods of the protographs, whose protograph codes can have girth larger than or equal to 14 or 18. We also propose a couple of shift value assigning rules for circulants of a QC LDPC code guaranteeing the girth 14.

IEEE Transactions on Information Theory•Aug 1, 2007•95 citations

Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs

David G. M. Mitchell, Roxana Smarandache, Daniel J. Costello

Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed upper limits on important code parameters, such as minimum distance and girth. In this paper, we consider an approach to constructing QC-LDPC codes that uses a two-step lifting procedure based on a protograph, and, by following this method instead of the usual one-step procedure, we obtain improved minimum distance and girth properties. We also present two new design rules for constructing good QC-LDPC codes using this two-step lifting procedure, and in each case, we obtain a significant increase in minimum distance and achieve a certain guaranteed girth compared with one-step circulant-based liftings. The expected performance improvement is verified by simulation results.

arXiv:1407.5364•IEEE Transactions on Information Theory•Jul 24, 2014•58 citations

Cycle Analysis and Construction of Protographs for QC LDPC Codes With Girth Larger Than 12

Sunghwan Kim, Jong‐Seon No, Habong Chung +1 more

A quasi-cyclic (QC) low-density parity-check (LDPC) code can be viewed as the protograph code with circulant permutation matrices. In this paper, we find all the subgraph patterns of protographs of QC LDPC codes having inevitable cycles of length 2i,i= 6,7,8,9,10, i.e., the cycles existing regardless of the shift values of circulants. It is also derived that if the girth of the protograph is 2g,gges 2, its protograph code cannot have the inevitable cycles of length smaller than 6g. Based on these subgraph patterns, we propose new combinatorial construction methods of the protographs, whose protograph codes can have girth larger than or equal to 14.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•8 citations

Maximum-girth slope-based quasi-cyclic (2, k ≥5) low-density parity-check codes

Morteza Esmaeili, Mohammad Gholami

A class of maximum-girth geometrically structured regular (n, 2, k≥5) (column-weight 2 and row-weight k) quasi-cyclic low-density parity-check (LDPC) codes is presented. The method is based on cylinder graphs and the slope concept. It is shown that the maximum girth achieved by these codes is 12. A low-complexity algorithm producing all such maximum-girth LDPC codes is given. The shortest constructed code has a length of 105. The minimum length n of a regular (2, k) LDPC code with girth g=12 determined by the Gallager bound has been achieved by the constructed codes. From the perspective of performance these codes outperform the column-weight 2 LDPC codes constructed by the previously reported methods. These codes can be encoded using an erasure decoding process.

IET Communications•Nov 30, 2008•7 citations
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.
There have been lots of efforts on the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes with large girth. However, most of them focus on protographs with single edges and little research has been done for the construction of QC LDPC codes lifted from protographs with multiple (i.e., parallel) edges. Compared to single-edge protographs, multiple-edge protographs have benefits such that QC LDPC codes lifted from them can potentially have larger minimum Hamming distance. In this paper, all subgraph patterns of multiple-edge protographs, which prevent QC LDPC codes from having large girth by inducing inevitable cycles, are fully investigated based on a graph-theoretic approach. By using combinatorial designs, a systematic construction method of multiple-edge protographs is proposed for regular QC LDPC codes with girth at least 12 and another method is proposed for regular QC LDPC codes with girth at least 14. Moreover, a construction algorithm of QC LDPC codes based on certain liftings of multiple-edge protographs is proposed and it is shown that the resulting QC LDPC codes have larger upper bounds on the minimum Hamming distance than those lifted from single-edge protographs. Simulation results are provided to compare the performance of the proposed QC LDPC codes with progressive edge-growth (PEG) LDPC codes and with PEG QC LDPC codes.
Multi-type quasi-cyclic (QC) low-density parity-check (LDPC) codes can be considered as multiple-edge protograph QC-LDPC codes having some advantages in the minimum Hamming distance bound over single-edge protograph codes or type-I QC-LDPC codes when the base matrices have the same size. In this paper, we investigate a class of multi-type QC-LDPC codes whose parity-check matrices contain just one blockrow of circulants and we obtain the generator matrix of such codes in general form. Using the permutation arrays and defining injection arrays, we present a new approach to construct a class of high-rate type-I QC-LDPC codes with girth 6 from the constructed 4-cycle free multi-type QC-LDPC codes. In continue, for 2 ≤ w ≤ 6, some type-w QC-LDPC codes with girth 6 are constructed explicitly such that the constructed codes are flexible in terms of rate and length. To the best of our knowledge, for w = 5,6, this is the first paper which deals with the explicit construction of type-w QC-LDPC codes with girth 6 and high rates. Moreover, for w = 3,4, the constructed type-w QC-LDPC codes have better (6,8)-cycle multiplicities than the codes with minimum achievable length recently constructed by cyclic difference families (CDFs). Simulation results show that the binary and non-binary constructed codes outperform the constituent underlying QC-LDPC codes.
A quasi-cyclic (QC) low-density parity-check (LDPC) code can be viewed as the protograph code with circulant permutation matrices (or circulants). In this correspondence, we find all the subgraph patterns of protographs of QC LDPC codes having inevitable cycles of length 2i, i = 6, 7, 8, 9,10, i.e., the cycles that always exist regardless of the shift values of circulants. It is also derived that if the girth of the protograph is 2g, g > 2, its protograph code cannot have the inevitable cycles of length smaller than 6g. Based on these subgraph patterns, we propose new combinatorial construction methods of the protographs, whose protograph codes can have girth larger than or equal to 14 or 18. We also propose a couple of shift value assigning rules for circulants of a QC LDPC code guaranteeing the girth 14.
Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed upper limits on important code parameters, such as minimum distance and girth. In this paper, we consider an approach to constructing QC-LDPC codes that uses a two-step lifting procedure based on a protograph, and, by following this method instead of the usual one-step procedure, we obtain improved minimum distance and girth properties. We also present two new design rules for constructing good QC-LDPC codes using this two-step lifting procedure, and in each case, we obtain a significant increase in minimum distance and achieve a certain guaranteed girth compared with one-step circulant-based liftings. The expected performance improvement is verified by simulation results.
A quasi-cyclic (QC) low-density parity-check (LDPC) code can be viewed as the protograph code with circulant permutation matrices. In this paper, we find all the subgraph patterns of protographs of QC LDPC codes having inevitable cycles of length 2i,i= 6,7,8,9,10, i.e., the cycles existing regardless of the shift values of circulants. It is also derived that if the girth of the protograph is 2g,gges 2, its protograph code cannot have the inevitable cycles of length smaller than 6g. Based on these subgraph patterns, we propose new combinatorial construction methods of the protographs, whose protograph codes can have girth larger than or equal to 14.
A class of maximum-girth geometrically structured regular (n, 2, k≥5) (column-weight 2 and row-weight k) quasi-cyclic low-density parity-check (LDPC) codes is presented. The method is based on cylinder graphs and the slope concept. It is shown that the maximum girth achieved by these codes is 12. A low-complexity algorithm producing all such maximum-girth LDPC codes is given. The shortest constructed code has a length of 105. The minimum length n of a regular (2, k) LDPC code with girth g=12 determined by the Gallager bound has been achieved by the constructed codes. From the perspective of performance these codes outperform the column-weight 2 LDPC codes constructed by the previously reported methods. These codes can be encoded using an erasure decoding process.