Title :
Rate-Compatible Puncturing of Finite-Length Low-Density Parity-Check Codes
Author :
Badri, N. ; Vellambi, R. ; Fekri, Faramarz
Author_Institution :
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA
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
Keywords :
AWGN channels; channel coding; graph theory; parity check codes; AWGN channel; BEC; LDPC codes; Tanner graph; additive white Gaussian noise channel; binary erasure channel; finite-length low-density parity-check codes; rate-compatible puncturing; AWGN; Additive white noise; Channel state information; Convolutional codes; Error correction; Error correction codes; Parity check codes; Time-varying channels;
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
DOI :
10.1109/ISIT.2006.261960