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 Vehicular Technology Conference

Greedy constructions of degree puncture sequences for irregular LDPC codes

Victor J. Stolpman, G.C. Orsak

Published Jan 18, 2006• 0 citations
Publisher

Abstract

In this paper, we introduce a new approach to puncturing irregular Low-Density Parity-Check (LDPC) mother codes. The proposed greedy approach constructs a single degree puncture sequence that identifies the variable-node degrees to puncture in a nested fashion. The construction is done one degree at a time choosing the variable-degree that requires the least amount of SNR for newly punctured ensemble. This approach takes into account the finite length of a particular LDPC code realization by adjusting the puncture probabilities using the finite granularity of each variable-degree available for puncturing given a codeword length. This greedy approach results in a single degree puncture sequence of encapsulating subsets for all possible code rates. Subsequently, a single variable-node sequence can be easily constructed from this degree sequence. In AWGN, the SNR gap performance of these rate-compatible LDPC codes varies little for a wide range of effective code rates with respect to the rate-distorted Shannon limit using binary source signalling.

DOI
10.1109/vetecf.2005.1558062

Related papers

A Rate-Compatible Puncturing Scheme for Finite-Length LDPC Codes

Reza Asvadi, Amir H. Banihashemi

In this paper, we propose a rate-compatible puncturing scheme for finite-length low-density parity-check (LDPC) codes over the additive white Gaussian noise (AWGN) channel. The proposed method is applicable to any LDPC mother code, both regular and irregular, and constructs punctured codes which perform well in both the waterfall and the error floor regions for a wide range of code rates. The scheme selects code bits to be punctured one at a time and based on a sequence of criteria. An important selection criterion is the number of short cycles with low approximate cycle extrinsic message degree (ACE) in which a candidate bit node participates. Simulation results demonstrate that the ACE measure, which is most often the determining criterion in the final selection of the puncturing candidates, plays an important role in improving the performance of the codes in both the waterfall and the error-floor regions. These results also demonstrate that the proposed scheme is superior to the existing puncturing methods, particularly when a wide range of code rates is desirable.

IEEE Communications Letters•Nov 30, 2012•27 citations

Rate-Compatible Puncturing of Finite-Length Low-Density Parity-Check Codes

Badri N. Vellambi, R. Badri, Faramarz Fekri

In this paper, we study rate-compatible puncturing of finite-length Low-Density Parity-Check (LDPC) codes. First, we derive simple and yet good bounds on the expected performance of punctured codes (constructed by random puncturing) over Binary Erasure Channel (BEC) as a function of the performance of their parent LDPC code. We then present a novel rate-compatible puncturing scheme that is very easy to implement. Our scheme uses the idea that a more uniform distribution of punctured bits across the Tanner graph results in punctured codes with better performance. Although the puncturing scheme tailored to regular codes is presented, it is also directly applicable to irregular parent ensembles. By simulations, the proposed rate-compatible puncturing scheme is shown to be superior to the existing puncturing methods for both regular and irregular LDPC codes over BEC and Additive White Gaussian Noise (AWGN) Channel.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2006•5 citations

Rate-compatible Puncturing Algorithm for Finite-length LDPC Codes

Niu He-ha

This paper propose a rate-compatible puncturing scheme for finite-length low-density parity-check(LDPC) codes over the additive white Gaussian noise(AWGN)channel.The method can applicable to both regular and irregular LDPC code.The scheme selects bits to be punctured base on a sequence of criteria.An important selection criterion is the number of short cycles with low approximate cycle extrinsic message degree(ACE)in which a candidate bit node participates.Simulation results demonstrate that the ACE plays an important role in the performance of the codes,these results also show that the scheme is superior to the existing puncturing methods in a wide range of code rates.

•Jan 1, 2013•0 citations

Novel intentional puncturing schemes for finite-length irregular LDPC codes

Jingjing Liu, Rodrigo C. de Lamare

In this paper, we investigate rate-compatible (RC) short/ moderate length irregular low-density parity-check (LDPC) codes and propose three different novel puncturing schemes to determine the preferred puncturing positions so as to achieve less performance degradation. The first one is based on a short cycle counting algorithm as well as grouping variable nodes which have the equal length of short cycles in the Tanner Graph; the second scheme can be seen as an improved version of the first one by means of introducing another metric called Extrinsic Message Degree (EMD); and the last scheme relies on a simulation-based exhaustive search in order to find the best puncturing pattern among several random puncturing patterns. The simulation results show that all three proposed schemes can achieve the rate flexibility and minimize the performance loss over the additive white Gaussian noise (AWGN) channel.

IEEE International Conference on Digital Signal Processing (DSP)•Jul 1, 2011•9 citations

Construction of Optimal Puncturing of Low-Density Parity-Check Codes

S. Suresh Kumar, Manju Rajaram

Low-density parity-check with Length-compatible and low error floors (LDPC-LCLEF) on the binary symmetric channel is presented in this paper. These codes can support a wide range of lengths for a given rate and also the Tanner graphs are free of small trapping sets. This can be obtained by applying the schemes of shortening and puncturing to good LDPC codes and the trapping sets are selected using the trapping set ontology based on their relative harmfulness for the given decoding algorithm. The conventional approach does not guarantee to have a good performance as the degree distributions may be wildly varied. In this paper, a modified algorithm is presented to generate LDPC codes of a given rate with almost their degree distributions are same as the mother code degree distribution. Also the relative harmfulness for different trapping sets are evaluated and decoding failures of one trapping set in presence or absence of other trapping sets are analyzed. To facilitate this discussion, a new description of structured LDPC codes with arrays of permutation matrices as parity-check matrices is given. Numerical results show that the LDPC code constructed by this approach performed much better than the conventional approach.

CiiT international journal of fuzzy systems•Jan 1, 2014•0 citations

A non-greedy puncturing method for rate-compatible LDPC codes

Lin Zhou, Wei‐Cheng Huang, Rui Zhao +1 more

In this paper, we propose a non-greedy punctur- ing method for constructing binary rate-compatible low-density parity-check codes. First, we show that the recovery error prob- ability for a punctured variable node can be reduced by allocat- ing a small number of unpunctured variable nodes in the recovery tree. Then, we redefine the recovery tree according to the princi- ple of iterative decoding with the sum-product algorithm. The pro- posed non-greedy puncturing algorithm lies mainly in the dynam- ical minimization of the number of unpunctured variable nodes in the redefined recovery tree for the punctured variable nodes. Fi- nally, simulation results show that the proposed puncturing algo- rithm outperforms the existing best puncturing algorithms in bit error rate performances of iterative decoding.

Journal of Communications and Networks•Feb 1, 2017•5 citations
In this paper, we introduce a new approach to puncturing irregular Low-Density Parity-Check (LDPC) mother codes. The proposed greedy approach constructs a single degree puncture sequence that identifies the variable-node degrees to puncture in a nested fashion. The construction is done one degree at a time choosing the variable-degree that requires the least amount of SNR for newly punctured ensemble. This approach takes into account the finite length of a particular LDPC code realization by adjusting the puncture probabilities using the finite granularity of each variable-degree available for puncturing given a codeword length. This greedy approach results in a single degree puncture sequence of encapsulating subsets for all possible code rates. Subsequently, a single variable-node sequence can be easily constructed from this degree sequence. In AWGN, the SNR gap performance of these rate-compatible LDPC codes varies little for a wide range of effective code rates with respect to the rate-distorted Shannon limit using binary source signalling.
In this paper, we propose a rate-compatible puncturing scheme for finite-length low-density parity-check (LDPC) codes over the additive white Gaussian noise (AWGN) channel. The proposed method is applicable to any LDPC mother code, both regular and irregular, and constructs punctured codes which perform well in both the waterfall and the error floor regions for a wide range of code rates. The scheme selects code bits to be punctured one at a time and based on a sequence of criteria. An important selection criterion is the number of short cycles with low approximate cycle extrinsic message degree (ACE) in which a candidate bit node participates. Simulation results demonstrate that the ACE measure, which is most often the determining criterion in the final selection of the puncturing candidates, plays an important role in improving the performance of the codes in both the waterfall and the error-floor regions. These results also demonstrate that the proposed scheme is superior to the existing puncturing methods, particularly when a wide range of code rates is desirable.
In this paper, we study rate-compatible puncturing of finite-length Low-Density Parity-Check (LDPC) codes. First, we derive simple and yet good bounds on the expected performance of punctured codes (constructed by random puncturing) over Binary Erasure Channel (BEC) as a function of the performance of their parent LDPC code. We then present a novel rate-compatible puncturing scheme that is very easy to implement. Our scheme uses the idea that a more uniform distribution of punctured bits across the Tanner graph results in punctured codes with better performance. Although the puncturing scheme tailored to regular codes is presented, it is also directly applicable to irregular parent ensembles. By simulations, the proposed rate-compatible puncturing scheme is shown to be superior to the existing puncturing methods for both regular and irregular LDPC codes over BEC and Additive White Gaussian Noise (AWGN) Channel.
This paper propose a rate-compatible puncturing scheme for finite-length low-density parity-check(LDPC) codes over the additive white Gaussian noise(AWGN)channel.The method can applicable to both regular and irregular LDPC code.The scheme selects bits to be punctured base on a sequence of criteria.An important selection criterion is the number of short cycles with low approximate cycle extrinsic message degree(ACE)in which a candidate bit node participates.Simulation results demonstrate that the ACE plays an important role in the performance of the codes,these results also show that the scheme is superior to the existing puncturing methods in a wide range of code rates.
In this paper, we investigate rate-compatible (RC) short/ moderate length irregular low-density parity-check (LDPC) codes and propose three different novel puncturing schemes to determine the preferred puncturing positions so as to achieve less performance degradation. The first one is based on a short cycle counting algorithm as well as grouping variable nodes which have the equal length of short cycles in the Tanner Graph; the second scheme can be seen as an improved version of the first one by means of introducing another metric called Extrinsic Message Degree (EMD); and the last scheme relies on a simulation-based exhaustive search in order to find the best puncturing pattern among several random puncturing patterns. The simulation results show that all three proposed schemes can achieve the rate flexibility and minimize the performance loss over the additive white Gaussian noise (AWGN) channel.
Low-density parity-check with Length-compatible and low error floors (LDPC-LCLEF) on the binary symmetric channel is presented in this paper. These codes can support a wide range of lengths for a given rate and also the Tanner graphs are free of small trapping sets. This can be obtained by applying the schemes of shortening and puncturing to good LDPC codes and the trapping sets are selected using the trapping set ontology based on their relative harmfulness for the given decoding algorithm. The conventional approach does not guarantee to have a good performance as the degree distributions may be wildly varied. In this paper, a modified algorithm is presented to generate LDPC codes of a given rate with almost their degree distributions are same as the mother code degree distribution. Also the relative harmfulness for different trapping sets are evaluated and decoding failures of one trapping set in presence or absence of other trapping sets are analyzed. To facilitate this discussion, a new description of structured LDPC codes with arrays of permutation matrices as parity-check matrices is given. Numerical results show that the LDPC code constructed by this approach performed much better than the conventional approach.
In this paper, we propose a non-greedy punctur- ing method for constructing binary rate-compatible low-density parity-check codes. First, we show that the recovery error prob- ability for a punctured variable node can be reduced by allocat- ing a small number of unpunctured variable nodes in the recovery tree. Then, we redefine the recovery tree according to the princi- ple of iterative decoding with the sum-product algorithm. The pro- posed non-greedy puncturing algorithm lies mainly in the dynam- ical minimization of the number of unpunctured variable nodes in the redefined recovery tree for the punctured variable nodes. Fi- nally, simulation results show that the proposed puncturing algo- rithm outperforms the existing best puncturing algorithms in bit error rate performances of iterative decoding.