The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory
Rate-compatible puncturing of low-density parity-check codes
IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs
IEEE Transactions on Information Theory
Stopping set distribution of LDPC code ensembles
IEEE Transactions on Information Theory
Rate-compatible punctured low-density parity-check codes with short block lengths
IEEE Transactions on Information Theory
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Hi-index | 0.01 |
In this paper, we study rate-compatible puncturing of finite-length low-density parity-check (LDPC) codes. We present a novel rate-compatible puncturing scheme that is easy to implement. Our scheme uses the idea that the degradation in performance is reduced by selecting a puncturing pattern wherein the punctured bits are far apart from each other in the Tanner graph of the code. Although the puncturing scheme presented is tailored to regular codes, 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 the binary erasure channel (BEC) and the additive white Gaussian noise (AWGN) Channel.