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

Analytical Lower Bound on the Lifting Degree of Multiple-Edge QC-LDPC Codes With Girth 6

Mohammad‐Reza Sadeghi, Farzane Amirzade

Published May 29, 2018• 24 citations
Publisher

Abstract

Multiple-edge protographs have some advantages over single-edge protographs, such as potentially having larger minimum Hamming distance. However, most of results in the literature are related to the construction of single-edge quasi-cyclic low-density parity-check codes (QC-LDPC) codes and little research has been done for the construction of multiple-edge QC-LDPC codes. In this letter, for the first time, necessary and sufficient conditions for the exponent matrices to have multiple-edge QC-LDPC codes with girth 6 are provided. As a consequence of this letter, a lower bound on the lifting degree of regular and irregular multiple-edge QC-LDPC codes with girth 6 is derived. We also present QC-LDPC codes whose lifting degrees meet our proposed lower bound. These codes have shorter lengths compared with single-edge QC-LDPC codes. Another contribution of this letter is presenting a technique to reduce the size of the search space to find these codes.

DOI
10.1109/lcomm.2018.2841873

Related papers

Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices

Farzane Amirzade, Mohammad‐Reza Sadeghi

In this paper, we define two matrices named as "difference matrices", denoted by $D$ and $DD$ which significantly contribute to achieve regular single-edge QC-LDPC codes with the shortest length and the certain girth as well as regular and irregular multiple-edge QC-LDPC codes. Making use of these matrices, we obtain necessary and sufficient conditions to have single-edge $(m,n)$-regular QC-LDPC codes with girth 6, 10 and 12. Additionally, for girth 6, we achieve all non-isomorphic codes with the minimum lifting degree, $N$, for $m=4$ and $5\leq n\leq 11$, and present an exponent matrix for each minimum distance. For girth 10, we provide a lower bound on the lifting degree which is tighter than the existing bound. More important, for an exponent matrix whose first row and first column are all-zero, we demonstrate that the non-existence of 8-cycles proves the non-existence of 6-cycles related to the first row of the exponent matrix too. All non-isomorphic QC-LDPC codes with girth 10 and $n=5,6$ whose numbers are more than those presented in the literature are provided. For $n=7,8$ we decrease the lifting degrees from 159 and 219 to 145 and 211, repectively. For girth 12, a lower bound on the lifting degree is achieved. For multiple-edge category, for the first time a lower bound on the lifting degree for both regular and irregular QC-LDPC codes with girth 6 is achieved. We also demonstrate that the achieved lower bounds on multiple-edge $(4,n)$-regular QC-LDPC codes with girth 6 are tight and the resultant codes have shorter length compared to their counterparts in single-edge codes. Additionally, difference matrices help to reduce the conditions of considering 6-cycles from seven states to five states. We obtain multiple-edge $(4,n)$-regular QC-LDPC codes with girth 8 and $n=4,6,8$ with the shortest length.

arXiv:1709.00825•Sep 4, 2017•2 citations

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

Hosung Park Seokbeom Hong

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 are focused on protographs with single edges and little research has been done for the construction of QC LDPC codes lifted from protographs with multiple 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 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 also other method is proposed for regular QC LDPC codes with girth at least 14. A construction algorithm of QC LDPC codes by lifting 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, the progressive edge-growth (PEG) LDPC codes, and the PEG QC LDPC codes.

•Jan 1, 2014•26 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

Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length

Farzane Amirzade, Mohammad‐Reza Sadeghi, Daniel Panario

We consider multiple-edge QC-LDPC codes with a base matrix of large size. We propose a new method, the degree reduction method, to obtain exponent matrices of these codes which considerably reduces the complexity of the search algorithm. We also provide a necessary and sufficient condition to avoid 4-cycles from occurrence in the Tanner graph of codes obtained using our method. Then, we apply our method to quasi-cyclic protograph-based Raptor-Like LDPC (QC-PBRL-LDPC) codes whose base matrices are multiple-edge. Numerical results show that as a consequence of this study we can obtain the minimum lifting degree of QC-PBRL-LDPC codes with girth at least 6. Thus, the lengths of the obtained codes are much smaller than those of their counterpart short-length codes in the literature.

IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•6 citations

Optimal Search for Girth-8 Quasi Cyclic and Spatially Coupled Multiple-Edge LDPC Codes

Mohammad‐Reza Sadeghi

Two essential categories of LDPC codes that are more preferable to other types are quasi-cyclic LDPC (QC-LDPC) codes and spatially coupled LDPC convolutional codes (SC-LDPC-CCs) because of their excellent performance curves in waterfall and error floor regions. An efficient approach to construct these codes is protograph-based method that is categorized into two classes: single-edge (SE) and multiple-edge (ME) protographs. We, for the first time, provide a necessary and sufficient condition for exponent matrices of these codes with girth-8 and based on the ME-protographs. As a result, a lower bound on the lifting degree of girth-8 ME-QC-LDPC codes and a lower bound on the syndrome former memory order of girth-8 ME-SC-LDPC-CCs are obtained, which are tighter than the existing bounds in the literature.

IEEE Communications Letters•Jun 25, 2019•20 citations

Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices

Farzane Amirzade, Mohammad‐Reza Sadeghi

In this paper, we define two “difference matrices” which correspond to an exponent matrix. We present necessary and sufficient conditions for these difference matrices to have quasi-cyclic low-density parity-check codes (QC-LDPC) codes with a certain girth. We achieve all non-isomorphic QC-LDPC codes with the shortest length, girth 6, the column weight, m = 4, and the row weight, 5 ≤ n ≤ 11. Moreover, a method to obtain an exponent matrix with girth 10 is presented which reduces the complexity of the search algorithm. If the first row and the first column of the exponent matrix are all-zero, then by applying our method we do not need to test Fossorier's lemma to avoid 6-cycles and 8-cycles. For girth 10, we also provide a lower bound on the lifting degree which is tighter than the existing bound. For girth 12, a new lower bound on the lifting degree is achieved.

IEEE Access•Jan 1, 2018•28 citations
Multiple-edge protographs have some advantages over single-edge protographs, such as potentially having larger minimum Hamming distance. However, most of results in the literature are related to the construction of single-edge quasi-cyclic low-density parity-check codes (QC-LDPC) codes and little research has been done for the construction of multiple-edge QC-LDPC codes. In this letter, for the first time, necessary and sufficient conditions for the exponent matrices to have multiple-edge QC-LDPC codes with girth 6 are provided. As a consequence of this letter, a lower bound on the lifting degree of regular and irregular multiple-edge QC-LDPC codes with girth 6 is derived. We also present QC-LDPC codes whose lifting degrees meet our proposed lower bound. These codes have shorter lengths compared with single-edge QC-LDPC codes. Another contribution of this letter is presenting a technique to reduce the size of the search space to find these codes.
In this paper, we define two matrices named as "difference matrices", denoted by DDD and DDDDDD which significantly contribute to achieve regular single-edge QC-LDPC codes with the shortest length and the certain girth as well as regular and irregular multiple-edge QC-LDPC codes. Making use of these matrices, we obtain necessary and sufficient conditions to have single-edge (m,n)(m,n)(m,n)-regular QC-LDPC codes with girth 6, 10 and 12. Additionally, for girth 6, we achieve all non-isomorphic codes with the minimum lifting degree, NNN, for m=4m=4m=4 and 5≤n≤115\leq n\leq 115≤n≤11, and present an exponent matrix for each minimum distance. For girth 10, we provide a lower bound on the lifting degree which is tighter than the existing bound. More important, for an exponent matrix whose first row and first column are all-zero, we demonstrate that the non-existence of 8-cycles proves the non-existence of 6-cycles related to the first row of the exponent matrix too. All non-isomorphic QC-LDPC codes with girth 10 and n=5,6n=5,6n=5,6 whose numbers are more than those presented in the literature are provided. For n=7,8n=7,8n=7,8 we decrease the lifting degrees from 159 and 219 to 145 and 211, repectively. For girth 12, a lower bound on the lifting degree is achieved. For multiple-edge category, for the first time a lower bound on the lifting degree for both regular and irregular QC-LDPC codes with girth 6 is achieved. We also demonstrate that the achieved lower bounds on multiple-edge (4,n)(4,n)(4,n)-regular QC-LDPC codes with girth 6 are tight and the resultant codes have shorter length compared to their counterparts in single-edge codes. Additionally, difference matrices help to reduce the conditions of considering 6-cycles from seven states to five states. We obtain multiple-edge (4,n)(4,n)(4,n)-regular QC-LDPC codes with girth 8 and n=4,6,8n=4,6,8n=4,6,8 with the shortest length.
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 are focused on protographs with single edges and little research has been done for the construction of QC LDPC codes lifted from protographs with multiple 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 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 also other method is proposed for regular QC LDPC codes with girth at least 14. A construction algorithm of QC LDPC codes by lifting 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, the progressive edge-growth (PEG) LDPC codes, and the PEG QC LDPC codes.
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.
We consider multiple-edge QC-LDPC codes with a base matrix of large size. We propose a new method, the degree reduction method, to obtain exponent matrices of these codes which considerably reduces the complexity of the search algorithm. We also provide a necessary and sufficient condition to avoid 4-cycles from occurrence in the Tanner graph of codes obtained using our method. Then, we apply our method to quasi-cyclic protograph-based Raptor-Like LDPC (QC-PBRL-LDPC) codes whose base matrices are multiple-edge. Numerical results show that as a consequence of this study we can obtain the minimum lifting degree of QC-PBRL-LDPC codes with girth at least 6. Thus, the lengths of the obtained codes are much smaller than those of their counterpart short-length codes in the literature.
Two essential categories of LDPC codes that are more preferable to other types are quasi-cyclic LDPC (QC-LDPC) codes and spatially coupled LDPC convolutional codes (SC-LDPC-CCs) because of their excellent performance curves in waterfall and error floor regions. An efficient approach to construct these codes is protograph-based method that is categorized into two classes: single-edge (SE) and multiple-edge (ME) protographs. We, for the first time, provide a necessary and sufficient condition for exponent matrices of these codes with girth-8 and based on the ME-protographs. As a result, a lower bound on the lifting degree of girth-8 ME-QC-LDPC codes and a lower bound on the syndrome former memory order of girth-8 ME-SC-LDPC-CCs are obtained, which are tighter than the existing bounds in the literature.
In this paper, we define two “difference matrices” which correspond to an exponent matrix. We present necessary and sufficient conditions for these difference matrices to have quasi-cyclic low-density parity-check codes (QC-LDPC) codes with a certain girth. We achieve all non-isomorphic QC-LDPC codes with the shortest length, girth 6, the column weight, m = 4, and the row weight, 5 ≤ n ≤ 11. Moreover, a method to obtain an exponent matrix with girth 10 is presented which reduces the complexity of the search algorithm. If the first row and the first column of the exponent matrix are all-zero, then by applying our method we do not need to test Fossorier's lemma to avoid 6-cycles and 8-cycles. For girth 10, we also provide a lower bound on the lifting degree which is tighter than the existing bound. For girth 12, a new lower bound on the lifting degree is achieved.