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

Asvadi, Reza; Banihashemi, Amir H.

doi:10.1109/lcomm.2012.112812.121785

Cited by 27 publications

(35 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1 compares the proposed scheme with the scheme in [9]. In the both scheme, we set l max = 10 and η ACE = 4 (referred to as η max in [9]). The maximum number of iterations is set to 15.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…Since short cycles with low ACE lead to performance degradation [12], it is desirable to avoid puncturing the variable nodes of such cycles. To evaluate the extent in which different variable nodes participate in short cycles with low ACE values, similar to [9], the ACE score spectrum of a variable node is defined as follows: Let C v (l) denote the set of the length 2l cycles in which variable node v participates. S v η ACE (l) represents the number of cycles with the ACE values more than η ACE in set C v (l).…”

Section: Ldpc Codes and Serial Schedulesmentioning

confidence: 99%

“…To further improve the performance of punctured LDPC codes, the distances of punctured variable nodes away from each other were regarded as the criteria to select punctured nodes [8]. In [9], the number of short cycles with low approximate cycle extrinsic message degree (ACE) played an important role in selecting punctured nodes. These schemes performed well over a wide range of code rates.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient Puncturing Scheme for Irregular LDPC Codes Based on Serial Schedules

Liu

2015

IEEE Commun. Lett.

View full text Add to dashboard Cite

In practice, low-density parity-check (LDPC) codes are usually decoded by serial schedules. However, the existing schemes for rate-compatible puncturing LDPC codes are proposed on the assumption that the flooding schedules are employed in decoding algorithm. In this letter, an efficient puncturing scheme is proposed for irregular LDPC codes based on serial schedule. The scheme selects variable nodes to be punctured one at a time. At each time, a check node is selected firstly based on the idea that the punctured variable nodes are allocated evenly to all the check nodes. Then the puncturing variable node is selected among its neighbors. Furthermore, the order of the check nodes in the selection serves as the updating order in the serial schedule, which ensures that all the punctured codes can be recovered at the first iteration. Simulation results demonstrate that the scheme performs better for a wide range of code rates compared with the existing puncturing scheme, especially for high-rate punctured codes.Index Terms-Rate-compatible punctured LDPC codes, highrate punctured codes, serial schedules, approximate cycle extrinsic message degree (ACE).

show abstract

“…1 compares the proposed scheme with the scheme in [9]. In the both scheme, we set l max = 10 and η ACE = 4 (referred to as η max in [9]). The maximum number of iterations is set to 15.…”

Section: Simulation Resultsmentioning

confidence: 99%

Section: Ldpc Codes and Serial Schedulesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Puncturing Scheme for Irregular LDPC Codes Based on Serial Schedules

Liu

2015

IEEE Commun. Lett.

View full text Add to dashboard Cite

show abstract

“…2 also shows the performance of IR-HARQ scheme using rate-compatible (RC) LDPC codes. We use a RC-LDPC code scheme that has a larger applicable rate range based on the puncturing method presented in [12]. The mother codes in consideration are rate 0.5 and 0.8 regular PEG LDPC codes with k = 1900.…”

Section: Construction Of Irregular Pr Codesmentioning

confidence: 99%

A Construction of Physical-Layer Systematic Raptor Codes Based on Protographs

et al. 2015

View full text Add to dashboard Cite

A construction of physical-layer Raptor (PLR) codes based on protographs is proposed. We first set up a sequence of signal-to-noise ratios (SNRs). For each SNR, we employ a modified protograph EXIT analysis to find the extra check nodes in addition to the existing check nodes so as to meet the threshold required by the outer low-density parity check code. PLR codes which are capacity-approaching for a wide SNR range can be obtained using the proposed construction.

show abstract

“…Reference [75] demonstrates punctured codes that have a low performance gap (≈0.2 dB) of dedicated LDPC codes using this approach. This basic idea of [75] was modified and improved upon in different ways in the work of [76][77][78][79]. The work of [80,81] (see also [82]) proposes ranking algorithms for shortlisting good puncturing patterns for a mother code using Gaussianapproximation-based density evolution techniques.…”

Section: Figure 14mentioning

confidence: 99%