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

arXiv:0905.3076 · IEEE International Symposium on Information Theory (ISIT)

On a class of doubly-generalized LDPC codes with single parity-check variable nodes

Enrico Paolini, Mark F. Flanagan, Marco Chiani, M.P.C. Fossorier

Published Jun 1, 2009• 3 citations
arXivHTMLPDF

Abstract

A class of doubly-generalized low-density parity-check (D-GLDPC) codes, where single parity-check (SPC) codes are used as variable nodes (VNs), is investigated. An expression for the growth rate of the weight distribution of any D-GLDPC ensemble with a uniform check node (CN) set is presented at first, together with an analytical technique for its efficient evaluation. These tools are then used for detailed analysis of a case study, namely, a rate-1/2 D-GLDPC ensemble where all the CNs are (7, 4) Hamming codes and all the VNs are length-7 SPC codes. It is illustrated how the VN representations can heavily affect the code properties and how different VN representations can be combined within the same graph to enhance some of the code parameters. The analysis is conducted over the binary erasure channel. Interesting features of the new codes include the capability of achieving a good compromise between waterfall and error floor performance while preserving graphical regularity, and values of threshold outperforming LDPC counterparts.

DOI
10.1109/isit.2009.5205731

Related papers

Doubly Generalized LDPC Codes over the AWGN Channel

Yige Wang, M.P.C. Fossorier

In this paper, the design of doubly generalized low-density parity-check (DGLDPC) codes is proposed. This approach generalizes the structure of LDPC codes at both check and variable nodes. The performance of DGLDPC codes over the AWGN channel is analyzed using EXIT charts. Combined with differential evolution optimization, this analysis provides thresholds for DGLDPC codes that are better than that of LDPC and GLDPC codes with the same maximum variable degree. These theoretical thresholds are verified via simulations. Furthermore DGLDPC codes exhibit a lower error floor compared with their LDPC and GLDPC counterparts.

IEEE Transactions on Communications•May 1, 2009•28 citations

On the Growth Rate of the Weight Distribution of Irregular Doubly Generalized LDPC Codes

Mark F. Flanagan, Enrico Paolini, Marco Chiani +1 more

In this paper, the asymptotic growth rate of the weight distribution of irregular doubly generalized LDPC (D-GLDPC) codes is derived. The analysis yields a compact expression which accurately approximates the growth rate function for the case of small linear-weight codewords. This paper generalizes existing results for LDPC and generalized LDPC (GLDPC) codes. Ensembles with smallest check or variable node minimum distance greater than 2 are shown to have good growth-rate behavior, while for other ensembles a fundamental parameter is identified which discriminates between an asymptotically small and an asymptotically large expected number of small linear-weight codewords. Also, in the latter case it is shown that the growth rate depends only on the check and variable nodes with minimum distance 2. An important connection between this new result and the stability condition of D-GLDPC codes over the BEC is highlighted. Such a connection, previously observed for LDPC and GLDPC codes, is now extended to the case of D-GLDPC codes. Finally, it is shown that the analysis may be extended to include the growth rate of the stopping set size distribution of irregular D-GLDPC codes.

IEEE Transactions on Information Theory•May 25, 2011•20 citations

Spectral Shape of Check-Hybrid GLDPC Codes

Enrico Paolini, Mark F. Flanagan, Marco Chiani +1 more

This paper analyzes the asymptotic exponent of both the weight spectrum and the stopping set size spectrum for a class of generalized low-density parity-check (GLDPC) codes. Specifically, all variable nodes (VNs) are assumed to have the same degree (regular VN set), while the check node (CN) set is assumed to be composed of a mixture of different linear block codes (hybrid CN set). A simple expression for the exponent (which is also referred to as the growth rate or the spectral shape) is developed. This expression is consistent with previous results, including the case where the normalized weight or stopping set size tends to zero. Furthermore, it is shown how certain symmetry properties of the local weight distribution at the CNs induce a symmetry in the overall weight spectral shape function.

arXiv:1005.4834•International Conference on Communications•May 1, 2010•6 citations

A class of doubly-generalized LDPC codes

Y. Min, Francis C. M. Lau, Chi Kong Tse

We propose a class of doubly-generalized LDPC (DGLDPC) codes that use single-parity-check (SPC) codes as component codes at the super-variable nodes (SVNs) and SPC product-codes (SPC-PCs) as component codes at the super-check nodes (SCNs). We propose a low-complexity iterative decoding algorithm catered for the special structures of the SPC-PCs. Finally, we present the error performance and the convergence rate of the proposed DGLDPC codes.

International Conference on Advanced Technologies for Communications•Oct 1, 2013•3 citations

On the Growth Rate of the Weight Distribution of Irregular Doubly-Generalized LDPC Codes

Mark F. Flanagan, Enrico Paolini, Marco Chiani +1 more

In this paper, an expression for the asymptotic growth rate of the number of small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC) codes is derived. The expression is compact and generalizes existing results for LDPC and generalized LDPC (GLDPC) codes. Ensembles with check or variable node minimum distance greater than 2 are shown to be have good growth rate behavior, while for other ensembles a fundamental parameter is identified which discriminates between an asymptotically small and an asymptotically large expected number of small linear-weight codewords. Also, in the latter case it is shown that the growth rate depends only on the check and variable nodes with minimum distance 2. An important connection between this new result and the stability condition of D-GLDPC codes over the BEC is highlighted. Such a connection, previously observed for LDPC and GLDPC codes, is now extended to the case of D-GLDPC codes. Finally, it is shown that the analysis may be extended to include the growth rate of the stopping set size distribution of irregular D-GLDPC codes.

arXiv:0903.1588•Mar 9, 2009•0 citations

Analysis of Generalized LDPC Codes with Random Component Codes for the Binary Erasure Channel

Enrico Paolini, M.P.C. Fossorier, Marco Chiani

In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes on the binary erasure channel (BEC) is proposed. The considered GLDPC codes have block linear codes as check nodes. Instead of considering specific check com-ponent codes, like Hamming or BCH codes, random codes are considered, and a technique is developed for obtaining the expected check EXIT function for the overall GLDPC code. Each check component code is supposed to belong to an expurgated ensemble. Some GLDPC thresholds obtained by this technique are com-pared with those of GLDPC codes, with the same dis-tribution and component codes lengths, using specific codes. Results obtained by combining our analysis with differential evolution tool are also presented. 1.

International Symposium on Information Theory and its Applications•Jan 1, 2006•12 citations
A class of doubly-generalized low-density parity-check (D-GLDPC) codes, where single parity-check (SPC) codes are used as variable nodes (VNs), is investigated. An expression for the growth rate of the weight distribution of any D-GLDPC ensemble with a uniform check node (CN) set is presented at first, together with an analytical technique for its efficient evaluation. These tools are then used for detailed analysis of a case study, namely, a rate-1/2 D-GLDPC ensemble where all the CNs are (7, 4) Hamming codes and all the VNs are length-7 SPC codes. It is illustrated how the VN representations can heavily affect the code properties and how different VN representations can be combined within the same graph to enhance some of the code parameters. The analysis is conducted over the binary erasure channel. Interesting features of the new codes include the capability of achieving a good compromise between waterfall and error floor performance while preserving graphical regularity, and values of threshold outperforming LDPC counterparts.
In this paper, the design of doubly generalized low-density parity-check (DGLDPC) codes is proposed. This approach generalizes the structure of LDPC codes at both check and variable nodes. The performance of DGLDPC codes over the AWGN channel is analyzed using EXIT charts. Combined with differential evolution optimization, this analysis provides thresholds for DGLDPC codes that are better than that of LDPC and GLDPC codes with the same maximum variable degree. These theoretical thresholds are verified via simulations. Furthermore DGLDPC codes exhibit a lower error floor compared with their LDPC and GLDPC counterparts.
In this paper, the asymptotic growth rate of the weight distribution of irregular doubly generalized LDPC (D-GLDPC) codes is derived. The analysis yields a compact expression which accurately approximates the growth rate function for the case of small linear-weight codewords. This paper generalizes existing results for LDPC and generalized LDPC (GLDPC) codes. Ensembles with smallest check or variable node minimum distance greater than 2 are shown to have good growth-rate behavior, while for other ensembles a fundamental parameter is identified which discriminates between an asymptotically small and an asymptotically large expected number of small linear-weight codewords. Also, in the latter case it is shown that the growth rate depends only on the check and variable nodes with minimum distance 2. An important connection between this new result and the stability condition of D-GLDPC codes over the BEC is highlighted. Such a connection, previously observed for LDPC and GLDPC codes, is now extended to the case of D-GLDPC codes. Finally, it is shown that the analysis may be extended to include the growth rate of the stopping set size distribution of irregular D-GLDPC codes.
This paper analyzes the asymptotic exponent of both the weight spectrum and the stopping set size spectrum for a class of generalized low-density parity-check (GLDPC) codes. Specifically, all variable nodes (VNs) are assumed to have the same degree (regular VN set), while the check node (CN) set is assumed to be composed of a mixture of different linear block codes (hybrid CN set). A simple expression for the exponent (which is also referred to as the growth rate or the spectral shape) is developed. This expression is consistent with previous results, including the case where the normalized weight or stopping set size tends to zero. Furthermore, it is shown how certain symmetry properties of the local weight distribution at the CNs induce a symmetry in the overall weight spectral shape function.
In this paper, an expression for the asymptotic growth rate of the number of small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC) codes is derived. The expression is compact and generalizes existing results for LDPC and generalized LDPC (GLDPC) codes. Ensembles with check or variable node minimum distance greater than 2 are shown to be have good growth rate behavior, while for other ensembles a fundamental parameter is identified which discriminates between an asymptotically small and an asymptotically large expected number of small linear-weight codewords. Also, in the latter case it is shown that the growth rate depends only on the check and variable nodes with minimum distance 2. An important connection between this new result and the stability condition of D-GLDPC codes over the BEC is highlighted. Such a connection, previously observed for LDPC and GLDPC codes, is now extended to the case of D-GLDPC codes. Finally, it is shown that the analysis may be extended to include the growth rate of the stopping set size distribution of irregular D-GLDPC codes.
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes on the binary erasure channel (BEC) is proposed. The considered GLDPC codes have block linear codes as check nodes. Instead of considering specific check com-ponent codes, like Hamming or BCH codes, random codes are considered, and a technique is developed for obtaining the expected check EXIT function for the overall GLDPC code. Each check component code is supposed to belong to an expurgated ensemble. Some GLDPC thresholds obtained by this technique are com-pared with those of GLDPC codes, with the same dis-tribution and component codes lengths, using specific codes. Results obtained by combining our analysis with differential evolution tool are also presented. 1.