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:1302.5166 · IEEE Communications Letters

Rate-Compatible Short-Length Protograph LDPC Codes

Thuy Vu Minh Nguyen, Aria Nosratinia

Published Mar 21, 2013• 49 citations
arXivHTMLPDF

Abstract

This paper produces a rate-compatible protograph LDPC code at 1k information blocklength with superior performance in both waterfall and error floor regions. The design of such codes has proved difficult in the past because the constraints imposed by structured design (protographs), rate-compatibility, as well as small block length, are not easily satisfied together. For example, as the block length decreases, the predominance of decoding threshold as the main parameter in coding design is reduced, thus complicating the search for good codes. Our rate-compatible protograph codes have rates ranging from 1/3 to 4/5 and show no error floor down to 10-6FER.

DOI
10.1109/lcomm.2013.031313.122046

Related papers

Design of improved quasi-cyclic protograph-based Raptor-like LDPC codes for short block-lengths

Sudarsan V. S. Ranganathan, D. Divsalar, Richard D. Wesel

Protograph-based Raptor-like low-density parity-check codes (PBRL codes) are a recently proposed family of easily encodable and decodable rate-compatible LDPC (RC-LDPC) codes. These codes have an excellent iterative decoding threshold and performance across all design rates. PBRL codes designed thus far, for both long and short block-lengths, have been based on optimizing the iterative decoding threshold of the protograph of the RC code family at various design rates. In this work, we propose a design method to obtain better quasi-cyclic (QC) RC-LDPC codes with PBRL structure for short block-lengths (of a few hundred bits). We achieve this by maximizing an upper bound on the minimum distance of any QC-LDPC code that can be obtained from the protograph of a PBRL ensemble. The obtained codes outperform the original PBRL codes at short block-lengths by significantly improving the error floor behavior at all design rates. Furthermore, we identify a reduction in complexity of the design procedure, facilitated by the general structure of a PBRL ensemble.

arXiv:1701.07531•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2017•10 citations

Protograph based LDPC codes with minimum distance linearly growing with block size

D. Divsalar, C. Jones, Samuel J. Dolinar +1 more

We propose several LDPC code constructions that simultaneously achieve good threshold and error floor performance. Minimum distance is shown to grow linearly with block size (similar to regular codes of variable degree at least 3) by considering ensemble average weight enumerators. Our constructions are based on projected graph, or protograph, structures that support high-speed decoder implementations. As with irregular ensembles, our constructions are sensitive to the proportion of degree-2 variable nodes. A code with too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code with too many such nodes tends to not exhibit a minimum distance that grows linearly in block length. In this paper we also show that preceding can be used to lower the threshold of regular LDPC codes. The decoding thresholds of the proposed codes, which have linearly increasing minimum distance in block size, outperform that of regular LDPC codes. Furthermore, a family of low to high rate codes, with thresholds that adhere closely to their respective channel capacity thresholds, is presented. Simulation results for a few example codes show that the proposed codes have low error floors as well as good threshold SNR performance.

Globecom•Jan 1, 2005•115 citations

Short Protograph-Based LDPC Codes

D. Divsalar, Sam Dolinar, Christopher Jones

In this paper we design protograph-based LDPC codes with short block sizes. Mainly we consider rate 1/2 codes with input block sizes 64, 128, and 256 bits. To simplify the encoder and decoder implementations for high data rate transmission, the structure of the codes is based on protographs and circulants. These codes are designed for short block sizes based on maximizing the minimum distance and stopping set size subject to a constraint on the maximum variable node degree. In particular, we consider codes with variable node degrees between 3 and 5. Increasing the node degree leads to larger minimum distances, at the expense of smaller girth. Therefore, there is a trade-off between undetected error rate performance (improved by increasing minimum distance) and the degree of sub-optimality of the iterative decoders typically used (which are adversely affected by graph loops). Various LDPC codes are compared and simulation results are provided.

IEEE Military Communications Conference (MILCOM)•Oct 1, 2007•23 citations

LDPC Codes with Minimum Distance Proportional to Block Size

D. Divsalar, Chris Jones, Samuel J. Dolinar +1 more

Low-density parity-check (LDPC) codes characterized by minimum Hamming distances proportional to block sizes have been demonstrated. Like the codes mentioned in the immediately preceding article, the present codes are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. The previously mentioned codes have low decoding thresholds and reasonably low error floors. However, the minimum Hamming distances of those codes do not grow linearly with code-block sizes. Codes that have this minimum-distance property exhibit very low error floors. Examples of such codes include regular LDPC codes with variable degrees of at least 3. Unfortunately, the decoding thresholds of regular LDPC codes are high. Hence, there is a need for LDPC codes characterized by both low decoding thresholds and, in order to obtain acceptably low error floors, minimum Hamming distances that are proportional to code-block sizes. The present codes were developed to satisfy this need. The minimum Hamming distances of the present codes have been shown, through consideration of ensemble-average weight enumerators, to be proportional to code block sizes. As in the cases of irregular ensembles, the properties of these codes are sensitive to the proportion of degree-2 variable nodes. A code having too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code having too many such nodes tends not to exhibit a minimum distance that is proportional to block size. Results of computational simulations have shown that the decoding thresholds of codes of the present type are lower than those of regular LDPC codes. Included in the simulations were a few examples from a family of codes characterized by rates ranging from low to high and by thresholds that adhere closely to their respective channel capacity thresholds; the simulation results from these examples showed that the codes in question have low error floors as well as low decoding thresholds. As an example, the illustration shows the protograph (which represents the blueprint for overall construction) of one proposed code family for code rates greater than or equal to 1.2. Any size LDPC code can be obtained by copying the protograph structure N times, then permuting the edges. The illustration also provides Field Programmable Gate Array (FPGA) hardware performance simulations for this code family. In addition, the illustration provides minimum signal-to-noise ratios (Eb/No) in decibels (decoding thresholds) to achieve zero error rates as the code block size goes to infinity for various code rates. In comparison with the codes mentioned in the preceding article, these codes have slightly higher decoding thresholds.

•Oct 1, 2009•0 citations

On efficient designing of protograph LDPC codes

Huong-Giang Nguyen, Nghia Xuan Pham, Thu Phuong Nguyen +1 more

This paper designs two protograph LDPC codes with code-rate $R > 1/2$. A simple method using the protograph extrinsic information transfer (PEXIT) to design the codes with a low decoding threshold and the asymptotic weight enumerator (AWE) to evaluate the error floor of the codes is deployed. Simulation results show that the proposed codes have a better error floor than prior art protograph codes and offer higher rate protographs.

The University of Danang - Journal of Science and Technology•Jun 29, 2021•0 citations

Design of rate-compatible protograph-based LDPC codes with mixed circulants

Yixuan Xie, John C. Mu, Jinhong Yuan

We propose a novel design of rate-compatible protograph-based low-density parity-check code families that can cover a wide range of code rates. In contrast to traditional method of lifting, our lifting method use a combination of different circulant matrix sizes for the base protograph and accumulator to increase the number of achievable rates. We apply this method to an existing code family called AR4JA, which can offer variable rates of R = n+1/n+2 by process of extension. The proposed codes namely mixed-circulant rate-compatible protograph code (MCRC-PC) can reduce the rate step within the AR4JA family. We show that the proposed codes can also retain many of the favorable properties of protograph codes such as a fast encoder and decoder implementation. A set of length k=1024 MCRC-PC codes is designed with decoding thresholds obtained from multi-edge type density evolution, and simulation results show that the rate compatible code family can achieve good performance under message passing decoding algorithm.

International Symposium on Turbo Codes and Iterative Information Processing•Sep 1, 2010•3 citations
This paper produces a rate-compatible protograph LDPC code at 1k information blocklength with superior performance in both waterfall and error floor regions. The design of such codes has proved difficult in the past because the constraints imposed by structured design (protographs), rate-compatibility, as well as small block length, are not easily satisfied together. For example, as the block length decreases, the predominance of decoding threshold as the main parameter in coding design is reduced, thus complicating the search for good codes. Our rate-compatible protograph codes have rates ranging from 1/3 to 4/5 and show no error floor down to 10-6FER.
Protograph-based Raptor-like low-density parity-check codes (PBRL codes) are a recently proposed family of easily encodable and decodable rate-compatible LDPC (RC-LDPC) codes. These codes have an excellent iterative decoding threshold and performance across all design rates. PBRL codes designed thus far, for both long and short block-lengths, have been based on optimizing the iterative decoding threshold of the protograph of the RC code family at various design rates. In this work, we propose a design method to obtain better quasi-cyclic (QC) RC-LDPC codes with PBRL structure for short block-lengths (of a few hundred bits). We achieve this by maximizing an upper bound on the minimum distance of any QC-LDPC code that can be obtained from the protograph of a PBRL ensemble. The obtained codes outperform the original PBRL codes at short block-lengths by significantly improving the error floor behavior at all design rates. Furthermore, we identify a reduction in complexity of the design procedure, facilitated by the general structure of a PBRL ensemble.
We propose several LDPC code constructions that simultaneously achieve good threshold and error floor performance. Minimum distance is shown to grow linearly with block size (similar to regular codes of variable degree at least 3) by considering ensemble average weight enumerators. Our constructions are based on projected graph, or protograph, structures that support high-speed decoder implementations. As with irregular ensembles, our constructions are sensitive to the proportion of degree-2 variable nodes. A code with too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code with too many such nodes tends to not exhibit a minimum distance that grows linearly in block length. In this paper we also show that preceding can be used to lower the threshold of regular LDPC codes. The decoding thresholds of the proposed codes, which have linearly increasing minimum distance in block size, outperform that of regular LDPC codes. Furthermore, a family of low to high rate codes, with thresholds that adhere closely to their respective channel capacity thresholds, is presented. Simulation results for a few example codes show that the proposed codes have low error floors as well as good threshold SNR performance.
In this paper we design protograph-based LDPC codes with short block sizes. Mainly we consider rate 1/2 codes with input block sizes 64, 128, and 256 bits. To simplify the encoder and decoder implementations for high data rate transmission, the structure of the codes is based on protographs and circulants. These codes are designed for short block sizes based on maximizing the minimum distance and stopping set size subject to a constraint on the maximum variable node degree. In particular, we consider codes with variable node degrees between 3 and 5. Increasing the node degree leads to larger minimum distances, at the expense of smaller girth. Therefore, there is a trade-off between undetected error rate performance (improved by increasing minimum distance) and the degree of sub-optimality of the iterative decoders typically used (which are adversely affected by graph loops). Various LDPC codes are compared and simulation results are provided.
Low-density parity-check (LDPC) codes characterized by minimum Hamming distances proportional to block sizes have been demonstrated. Like the codes mentioned in the immediately preceding article, the present codes are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. The previously mentioned codes have low decoding thresholds and reasonably low error floors. However, the minimum Hamming distances of those codes do not grow linearly with code-block sizes. Codes that have this minimum-distance property exhibit very low error floors. Examples of such codes include regular LDPC codes with variable degrees of at least 3. Unfortunately, the decoding thresholds of regular LDPC codes are high. Hence, there is a need for LDPC codes characterized by both low decoding thresholds and, in order to obtain acceptably low error floors, minimum Hamming distances that are proportional to code-block sizes. The present codes were developed to satisfy this need. The minimum Hamming distances of the present codes have been shown, through consideration of ensemble-average weight enumerators, to be proportional to code block sizes. As in the cases of irregular ensembles, the properties of these codes are sensitive to the proportion of degree-2 variable nodes. A code having too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code having too many such nodes tends not to exhibit a minimum distance that is proportional to block size. Results of computational simulations have shown that the decoding thresholds of codes of the present type are lower than those of regular LDPC codes. Included in the simulations were a few examples from a family of codes characterized by rates ranging from low to high and by thresholds that adhere closely to their respective channel capacity thresholds; the simulation results from these examples showed that the codes in question have low error floors as well as low decoding thresholds. As an example, the illustration shows the protograph (which represents the blueprint for overall construction) of one proposed code family for code rates greater than or equal to 1.2. Any size LDPC code can be obtained by copying the protograph structure N times, then permuting the edges. The illustration also provides Field Programmable Gate Array (FPGA) hardware performance simulations for this code family. In addition, the illustration provides minimum signal-to-noise ratios (Eb/No) in decibels (decoding thresholds) to achieve zero error rates as the code block size goes to infinity for various code rates. In comparison with the codes mentioned in the preceding article, these codes have slightly higher decoding thresholds.
This paper designs two protograph LDPC codes with code-rate R>1/2R > 1/2R>1/2. A simple method using the protograph extrinsic information transfer (PEXIT) to design the codes with a low decoding threshold and the asymptotic weight enumerator (AWE) to evaluate the error floor of the codes is deployed. Simulation results show that the proposed codes have a better error floor than prior art protograph codes and offer higher rate protographs.
We propose a novel design of rate-compatible protograph-based low-density parity-check code families that can cover a wide range of code rates. In contrast to traditional method of lifting, our lifting method use a combination of different circulant matrix sizes for the base protograph and accumulator to increase the number of achievable rates. We apply this method to an existing code family called AR4JA, which can offer variable rates of R = n+1/n+2 by process of extension. The proposed codes namely mixed-circulant rate-compatible protograph code (MCRC-PC) can reduce the rate step within the AR4JA family. We show that the proposed codes can also retain many of the favorable properties of protograph codes such as a fast encoder and decoder implementation. A set of length k=1024 MCRC-PC codes is designed with decoding thresholds obtained from multi-edge type density evolution, and simulation results show that the rate compatible code family can achieve good performance under message passing decoding algorithm.