Skip to content
Open access

AoI-Aware Polar Code Blind Rate Adaptation

Oct 2026 · IEEE Communications Letters · Vol 30, pp. 3651-3654 · 0 citations · 12 references
Computer Science Mathematics

Abstract

We study adaptive prefix-length selection for reliability-ordered coded transmission over <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula> coordinates, using only the <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> 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 <inline-formula> <tex-math notation="LaTeX">$O(1)$ </tex-math></inline-formula> per-slot cost with no channel estimation, inducing an irreducible birth–death chain whose mean drift fixes a unique balance point <inline-formula> <tex-math notation="LaTeX">$K^{\dagger } $ </tex-math></inline-formula> (largest <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> with success probability <inline-formula> <tex-math notation="LaTeX">$\ge \tfrac {1}{2}$ </tex-math></inline-formula>), 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.

Read PDF

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.