A Caltech Library Service

H-ARQ Rate-Compatible Structured LDPC Codes

El-Khamy, Mostafa and Hou, Jilei and Bhushan, Naga (2006) H-ARQ Rate-Compatible Structured LDPC Codes. In: 2006 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, pp. 1134-1138. ISBN 1-4244-0505-X.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


In this paper, we design families of rate-compatible structured LDPC codes suitable for hybrid ARQ applications with high throughput. We devise a systematic technique of low complexity for the design of structured low-rate LDPC codes from higher rate ones. These codes have a good performance on the AWGN channel and are robust against erasures and puncturing. The codes designed here are protograph-based codes and have fast encoding and decoding structures. These low rate codes are used as the parent codes of rate-compatible families. Then, we propose a number of algorithms for puncturing the codes in a rate compatible manner to construct codes of higher rates. The two most promising ones are the random puncturing search technique and progressive node puncturing. We show that using the techniques in this paper one could construct a high throughput rate compatible family with codes whose rates are in the range from 0.1 to 0.9 and which are within 1 dB from the channel capacity and have good error floors.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 2006 IEEE.
Record Number:CaltechAUTHORS:20170509-155808825
Persistent URL:
Official Citation:M. El-Khamy, J. Hou and N. Bhushan, "H-ARQ Rate-Compatible Structured LDPC Codes," 2006 IEEE International Symposium on Information Theory, Seattle, WA, 2006, pp. 1134-1138. doi: 10.1109/ISIT.2006.261961
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:77316
Deposited On:16 May 2017 21:56
Last Modified:15 Nov 2021 17:29

Repository Staff Only: item control page