We present a new reliability-based hybrid automatic repeat request (RB-HARQ) scheme based on low density parity check (LDPC) codes. With the proposed RB-HARQ, which uses a rate-compatible LDPC code with puncturing and extending, the longest codeword is divided into clusters of code bits. Unlike previous works, in the event of a decoding failure, the receiver measures the reliability of received clusters, instead of code bits, and determines which cluster would be most beneficial for retransmission. Several metrics to determine the best cluster candidates for retransmission are derived analytically. We show that one of the new metrics outperforms the previous metrics. We also show that even with the feedback overhead taken into account, our RB-HARQ can still result in significant gain over the previous works, provided that the cluster size is appropriately selected.

Additional Metadata
Keywords Hybrid ARQ, Rate-compatible LDPC codes, Reliability-based hybrid ARQ
Persistent URL dx.doi.org/10.1109/CWIT.2015.7255170
Conference 14th IEEE Canadian Workshop on Information Theory, CWIT 2015
Citation
Saber, H. (Hamid), & Marsland, I. (2015). A new reliability-based incremental redundancy hybrid ARQ scheme using LDPC codes. Presented at the 14th IEEE Canadian Workshop on Information Theory, CWIT 2015. doi:10.1109/CWIT.2015.7255170