Enhanced Feedback Mechanisms for Resource-Efficient Incremental Redundancy
Abstract
Incremental redundancy (IR) can reduce error rates by spreading coded bits across multiple transmission attempts. However, conventional stop-and-wait operation with coarse feedback often over-provisions retransmissions, triggers unnecessary decoding attempts, and increases end-to-end latency. This paper develops enhanced feedback and scheduling mechanisms that predict the additional redundancy needed for successful decoding and allocate only the required resources. We study two complementary strategies. First, using channel statistics, we learn a one- or two-shot mapping from channel quality to the minimum redundancy budget. As a byproduct, we derive an achievable reliability lower bound on the error probability of hybrid automatic repeat request (HARQ) systems. Numerical results with polar-coded IR-HARQ scheme show that the bound can be closely approached by appropriately selecting the second-transmission redundancy over a wide SNR range with savings up to 60\% in retransmission size. Second, we propose a realization-aware early-feedback mechanism that uses first-transmission reliability information to make per-codeword decisions before decoding: whether the codeword is already decodable, if not, how many additional redundancy versions are needed, or whether decoding is unlikely and rate adaptation is preferable. Link-level simulations with 5G NR LDPC codes show that both predictors achieve high accuracy (about 96\% in our study), increasing the probability of successful decoding within at most two transmission occasions.
Related
- Scalable Incremental Robustness Analysis of Neural Network Feedback Systems
- Separating Non-redundancy and Chain Length
- Redundancy and Renewal of Servers in Opened Queuing Networks
- On the Observability and Redundancy of Intelligent Transportation Networks
- Redundancy and synergy in multivariate Gaussians via the Blackwell order
BibTeX
@misc{coskun2026enhanced,
title = {{Enhanced Feedback Mechanisms for Resource-Efficient Incremental Redundancy}},
author = {Mustafa Cemil Coşkun and Ahmed Elkelesh and Avijit Mandal and Homa Esfahanizadeh},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2607.14247},
eprint = {2607.14247},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.14247},
}
RIS
TY - UNPB
TI - Enhanced Feedback Mechanisms for Resource-Efficient Incremental Redundancy
AU - Mustafa Cemil Coşkun
AU - Ahmed Elkelesh
AU - Avijit Mandal
AU - Homa Esfahanizadeh
PY - 2026
DA - 2026/09/22
PB - arXiv
DO - 10.48550/arxiv.2607.14247
UR - https://arxiv.org/abs/2607.14247
AB - Incremental redundancy (IR) can reduce error rates by spreading coded bits across multiple transmission attempts. However, conventional stop-and-wait operation with coarse feedback often over-provisions retransmissions, triggers unnecessary decoding attempts, and increases end-to-end latency. This paper develops enhanced feedback and scheduling mechanisms that predict the additional redundancy needed for successful decoding and allocate only the required resources. We study two complementary strategies. First, using channel statistics, we learn a one- or two-shot mapping from channel quality to the minimum redundancy budget. As a byproduct, we derive an achievable reliability lower bound on the error probability of hybrid automatic repeat request (HARQ) systems. Numerical results with polar-coded IR-HARQ scheme show that the bound can be closely approached by appropriately selecting the second-transmission redundancy over a wide SNR range with savings up to 60\% in retransmission size. Second, we propose a realization-aware early-feedback mechanism that uses first-transmission reliability information to make per-codeword decisions before decoding: whether the codeword is already decodable, if not, how many additional redundancy versions are needed, or whether decoding is unlikely and rate adaptation is preferable. Link-level simulations with 5G NR LDPC codes show that both predictors achieve high accuracy (about 96\% in our study), increasing the probability of successful decoding within at most two transmission occasions.
ER -