AoI-Aware Polar Code Blind Rate Adaptation
Abstract
We study adaptive prefix-length selection for reliability-ordered coded transmission over N coordinates, using only the K most reliable, to balance age of information (AoI) against throughput. An additive-increase/decrease (AID) prefix-walk controller updates the prefix length from the last decoding outcome alone, at O(1) per-slot cost with no channel estimation, inducing an irreducible birth--death chain whose mean drift fixes a unique balance point K† (largest K with success probability ≥1/2), around which the stationary distribution concentrates geometrically. We derive this distribution in closed form via detailed balance and obtain exact steady-state AoI and goodput via renewal-reward analysis. Simulations on a $64$-coordinate polar code over a binary symmetric channel (BSC) confirm these predictions to within 0.3%. Relative to a genie-aided upper bound with perfect channel knowledge, we further quantify the goodput cost of adapting from a single feedback bit alone.
Related
- Point Cloud Transmission With Patch-Based Rate Adaptation
- Dependency-Aware HARQ and Link Adaptation for Wireless Transmission of Open-Vocabulary Scene Graphs
- AURA: Angular Update Rate Adaptation for training complex-valued neural networks
- dFlowGRPO: Rate-Aware Policy Optimization for Discrete Flow Models
- RACE: Residual-Aware Test-Time Adaptation for Neighbor-Rich Time-Series Foundation Model Forecasting
BibTeX
@misc{tavakoli2026aoiaware,
title = {{AoI-Aware Polar Code Blind Rate Adaptation}},
author = {Hassan Tavakoli},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.27593},
eprint = {2610.27593},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.27593},
}
RIS
TY - UNPB
TI - AoI-Aware Polar Code Blind Rate Adaptation
AU - Hassan Tavakoli
PY - 2026
DA - 2026/10/20
PB - arXiv
DO - 10.48550/arxiv.2610.27593
UR - https://arxiv.org/abs/2610.27593
AB - We study adaptive prefix-length selection for reliability-ordered coded transmission over N coordinates, using only the K most reliable, to balance age of information (AoI) against throughput. An additive-increase/decrease (AID) prefix-walk controller updates the prefix length from the last decoding outcome alone, at O(1) per-slot cost with no channel estimation, inducing an irreducible birth--death chain whose mean drift fixes a unique balance point K^† (largest K with success probability ≥1/2), around which the stationary distribution concentrates geometrically. We derive this distribution in closed form via detailed balance and obtain exact steady-state AoI and goodput via renewal-reward analysis. Simulations on a $64$-coordinate polar code over a binary symmetric channel (BSC) confirm these predictions to within 0.3%. Relative to a genie-aided upper bound with perfect channel knowledge, we further quantify the goodput cost of adapting from a single feedback bit alone.
ER -