摘要
Reliability-based hybrid automatic repeat request （ARQ） （RB-HARQ） is a recently introduced approach to incremental-redundancy ARQ. In RB-HARQ scheme, the bits that are to be retransmitted are adaptively selected at the receiver based on the estimated bit reliability. It could result in significant performance gain but requires huge overhead in the feedback channel. In this study, an improved RB-HARQ scheme （IRB-HARQ） for structured low-density parity-check codes is proposed, which simplifies the comparison operations needed to search the bits to be retransmitted and outperforms the RB-HARQ scheme in consideration of the bit transmission power for the requesting messages on the feedback link. Simulation results show that the IRB-HARQ scheme is more efficient and practical than the RB-HARQ scheme.
Reliability-based hybrid automatic repeat request （ARQ） （RB-HARQ） is a recently introduced approach to incremental-redundancy ARQ. In RB-HARQ scheme, the bits that are to be retransmitted are adaptively selected at the receiver based on the estimated bit reliability. It could result in significant performance gain but requires huge overhead in the feedback channel. In this study, an improved RB-HARQ scheme （IRB-HARQ） for structured low-density parity-check codes is proposed, which simplifies the comparison operations needed to search the bits to be retransmitted and outperforms the RB-HARQ scheme in consideration of the bit transmission power for the requesting messages on the feedback link. Simulation results show that the IRB-HARQ scheme is more efficient and practical than the RB-HARQ scheme.
