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 Wireless Communications and Signal Processing (WCSP)

An effective puncturing scheme for rate-compatible LDPC codes

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

Published Oct 1, 2010• 3 citations
Publisher

Abstract

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.

DOI
10.1109/wcsp.2010.5632510

Related papers

Rate-compatible punctured LDPC codes based on recovery tree

Sunghoon Choi, Kwangseok Noh, Jeong Hwan Shin +1 more

We consider the challenges of finding good puncturing patterns for rate-compatible LDPC codes over additive white Gaussian noise (AWGN) channel. In previous works, the role of survived check nodes in puncturing patterns was considered with the limitations such as single survived check node assumption and simulation-based verification. In this paper, we analyze the performance according to the role of multiple survived check nodes and multiple dead check nodes. Based on theses analyses, we propose new algorithm to find good puncturing pattern for LDPC codes over additive white Gaussian noise (AWGN) channel.

International Symposium on Information Theory and its Applications•Dec 1, 2008•0 citations

Puncturing schemes for rate-compatible non-binary LDPC codes

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

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.

International Conference on Electronics, Communications and Control•Sep 1, 2011•0 citations

Node-wise Analysis of Puncturing Patterns for LDPC Codes over AWGN Channel

Sunghoon Choi, Jun Heo

In this paper, we analyze the effect of puncturing patterns for rate-compatible Low-Density Parity-Check (LDPC) codes. Each punctured variable node are connected with multiple check nodes and the check nodes are categorized into two groups named as ‘survived check (SC) node’ and ‘dead check (DC) node’ according to the role of them [3]. With this categorization, we derived the node-wise error probability using density evolution and presented simulation results which were well matched with the analysis.

International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)•Jul 1, 2007•0 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

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

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
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.
We consider the challenges of finding good puncturing patterns for rate-compatible LDPC codes over additive white Gaussian noise (AWGN) channel. In previous works, the role of survived check nodes in puncturing patterns was considered with the limitations such as single survived check node assumption and simulation-based verification. In this paper, we analyze the performance according to the role of multiple survived check nodes and multiple dead check nodes. Based on theses analyses, we propose new algorithm to find good puncturing pattern for LDPC codes over additive white Gaussian noise (AWGN) channel.
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 analyze the effect of puncturing patterns for rate-compatible Low-Density Parity-Check (LDPC) codes. Each punctured variable node are connected with multiple check nodes and the check nodes are categorized into two groups named as ‘survived check (SC) node’ and ‘dead check (DC) node’ according to the role of them [3]. With this categorization, we derived the node-wise error probability using density evolution and presented simulation results which were well matched with the analysis.
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 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 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.