Search arXivSearch

arXiv · 2609.03735

TokenComSR: Task-Sensitivity-Guided Token Communication for Wireless Image Super-Resolution

Abstract

For resource-constrained wireless edge devices over bandwidth-limited fading channels, wireless image transmission using traditional separate coding suffers from the cliff-effect collapse. Prevailing deep joint source-channel coding (JSCC) based on convolutional neural networks can mitigate this issue but usually fail to preserve patch-level structures, thereby preventing adaptive per-token power allocation and limiting token-domain compensation for super-resolution (SR). To address these challenges, we propose a token communication framework with SR (TokenComSR). Specifically, we conceive a task-sensitive power allocation (TSPA) module and a signal-to-noise ratio (SNR)-conditioned token refinement module (TRM). TSPA distills training estimates of task sensitivity into inference token power weights, while TRM estimates an SNR-conditioned residual to correct channel-induced distortion in the token domain before decoding. Building on TSPA and TRM, the proposed TokenComSR pairs a Swin Transformer-based token transceiver with a receiver-side SR module for resource-constrained wireless image transmission. Simulation results confirm the effectiveness of the proposed TSPA and TRM, demonstrating improvements over separate coding and JSCC-SR baselines in both reconstruction fidelity and perceptual quality.

Explore related subjects

Keep this discovery

BibTeXRIS

Ye Wang, Li Qiao, Zhen Gao, Hua Wang. 2026-09-03. TokenComSR: Task-Sensitivity-Guided Token Communication for Wireless Image Super-Resolution. https://arxiv.org/abs/2609.03735

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

A simple derivation of the Kalman filter

In this lecture note, we present a concise and self-contained derivation of the discrete-time Kalman filter equations that requires only a basic understanding of least squares estimation. The treatment is designed to minimize mathematical overhead while preserving both rigor and generality.

math.OC

Constrained Parameter Update Law for Adaptive Control

In this paper, constrained parameter update laws for adaptive control are developed using barrier constraints. An interpretation of the parameter update law from a constrained optimization problem, in which a regularized Barrier saddle function is formulated to incorporate parameter constraints using inverse and logarithmic barrier functions from interior-point methods. The resulting constrained update law is integrated with an adaptive trajectory tracking controller, enabling online learning of the unknown system model parameters. Forward invariance of the parameter estimate is established and Lyapunov stability of the closed-loop system with the constrained parameter update law is derived. The effectiveness of the proposed constrained adaptive control law is demonstrated through simulations, which validate its ability to maintain parameter estimates within prescribed bounds while ensuring convergence to the true parameter values and achieving steady state tracking performance.

math.OC