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

Abstract

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

10 Figures and Tables

Cite this paper

@article{Badri2006RateCompatiblePO, title={Rate-Compatible Puncturing of Finite-Length Low-Density Parity-Check Codes}, author={Nabil Badri and R. Vellambi and Faramarz Fekri}, journal={2006 IEEE International Symposium on Information Theory}, year={2006}, pages={1129-1133} }