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

International Conference on Electronics, Communications and Control

Puncturing schemes for rate-compatible non-binary LDPC codes

Bing Zhang, He-Guang Su, Shu‐Tao Xia

Published Sep 1, 2011• 0 citations
Publisher

Abstract

Finding good puncturing patterns for rate compatible non-binary LDPC codes are considered over additive white Gaussian noise (AWGN) channels in this paper. We first study several popular puncturing schemes for binary LDPC codes and generalize them to non-binary LDPC codes, where the effects of short cycles in Tanner graph are rarely investigated. By care fully studying the impacts of short cycles when puncturing, we put forward a novel puncturing scheme for rate-compatible non binary LDPC codes. Simulation results show that the proposed puncturing scheme is superior to the above known ones for rate compatible non-binary LDPC codes over AWGN channels at certain cases.

DOI
10.1109/icecc.2011.6067599

Related papers

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

An effective puncturing scheme for rate-compatible LDPC codes

He-Guang Su, Mingqiu Wang, Shu‐Tao Xia

We consider the problem of finding good puncturing patterns for rate-compatible LDPC codes over additive white Gaussian noise (AWGN) channels. When studying the recovered process of punctured nodes, Ha et al maximized the number of lower Ä-SR nodes and obtained a so-called grouping and sorting puncturing scheme, where only single survived check node was guaranteed. In this paper, we investigate the effect of multiple survived check nodes and afford theoretical analysis to them. Based on the analysis, we propose an effective puncturing scheme called MSCN, which maximizes the number of survived check nodes. The MSCN scheme is quite different from the grouping and sorting scheme in the rules of finding nodes and update. By simulations, the MSCN scheme is shown to be superior to the grouping and sorting scheme over AWGN channels at low rates for rate-compatible LDPC codes.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2010•3 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

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

A cycle-based rate-compatible puncturing technique for non-binary LDPC codes

Kuntal Deka, A. Rajesh, Prabin Kumar Bora

This paper presents a cycle-based rate-compatible puncturing technique for non-binary (NB) low-density parity-check (LDPC) codes. The proposed puncturing technique is based on the connectivity of the short non-binary (NB) cycles present in the Tanner graph. The connectivity of a cycle is measured by the extrinsic message degree (EMD). The short cycles with low values of EMD degrade the performance of iterative decoders significantly. The proposed technique selects the variable nodes for puncturing by reckoning their involvements in the short NB cycles with a low EMD. Simulations in different contexts are performed to check the efficiency of the proposed technique.

International Conference on Signal Processing and Communications (SPCOM)•Jun 1, 2016•1 citation
Finding good puncturing patterns for rate compatible non-binary LDPC codes are considered over additive white Gaussian noise (AWGN) channels in this paper. We first study several popular puncturing schemes for binary LDPC codes and generalize them to non-binary LDPC codes, where the effects of short cycles in Tanner graph are rarely investigated. By care fully studying the impacts of short cycles when puncturing, we put forward a novel puncturing scheme for rate-compatible non binary LDPC codes. Simulation results show that the proposed puncturing scheme is superior to the above known ones for rate compatible non-binary LDPC codes over AWGN channels at certain cases.
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.
We consider the problem of finding good puncturing patterns for rate-compatible LDPC codes over additive white Gaussian noise (AWGN) channels. When studying the recovered process of punctured nodes, Ha et al maximized the number of lower Ä-SR nodes and obtained a so-called grouping and sorting puncturing scheme, where only single survived check node was guaranteed. In this paper, we investigate the effect of multiple survived check nodes and afford theoretical analysis to them. Based on the analysis, we propose an effective puncturing scheme called MSCN, which maximizes the number of survived check nodes. The MSCN scheme is quite different from the grouping and sorting scheme in the rules of finding nodes and update. By simulations, the MSCN scheme is shown to be superior to the grouping and sorting scheme over AWGN channels at low rates for rate-compatible LDPC codes.
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.
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.
This paper presents a cycle-based rate-compatible puncturing technique for non-binary (NB) low-density parity-check (LDPC) codes. The proposed puncturing technique is based on the connectivity of the short non-binary (NB) cycles present in the Tanner graph. The connectivity of a cycle is measured by the extrinsic message degree (EMD). The short cycles with low values of EMD degrade the performance of iterative decoders significantly. The proposed technique selects the variable nodes for puncturing by reckoning their involvements in the short NB cycles with a low EMD. Simulations in different contexts are performed to check the efficiency of the proposed technique.