Low-Complexity OTFS-Based Over-the-Air Computation Design for Time-Varying Channels
Xinyu Huang, Henrik Hellström, Carlo Fischione
TL;DR
This work addresses AirComp for high-mobility devices over multipath time-varying channels by employing OTFS to render the DD-domain channel quasi-static and robust to Doppler. It proposes three schemes: S1 optimizes transmit powers and a denoising factor to minimize MSE; S2 adds zero-padding with SIC-based interference cancellation to further reduce MSE while lowering complexity; and S3 formulates a matrix-based, iterative design that jointly optimizes device precoders and FC receivers. Numerical results show S3 achieves the best error performance at higher complexity, S2 offers a favorable MSE-CPU trade-off, and S1 remains robust with low complexity, particularly at low SNR. These findings highlight practical paths for efficient AirComp in dynamic wireless environments, with implications for IoT, federated learning, and integrated sensing-communication systems.
Abstract
This paper investigates over-the-air computation (AirComp) over multiple-access time-varying channels, where devices with high mobility transmit their sensing data to a fusion center (FC) for averaging. To combat the Doppler shift induced by time-varying channels, each device adopts orthogonal time frequency space (OTFS) modulation. Our objective is minimizing the mean squared error (MSE) for the target function estimation. Due to the multipath time-varying channels, the OTFS-based AirComp not only suffers from noise but also interference. Specifically, we propose three schemes, namely S1, S2, and S3, for the target function estimation. S1 directly estimates the target function under the impacts of noise and interference. S2 mitigates the interference by introducing a zero padding-assisted OTFS. In S3, we propose an iterative algorithm to estimate the function in a matrix form. In the numerical results, we evaluate the performance of S1, S2, and S3 from the perspectives of MSE and computational complexity, and compare them with benchmarks. Specifically, compared to benchmarks, S3 outperforms them with a significantly lower MSE but incurs a higher computational complexity. In contrast, S2 demonstrates a reduction in both MSE and computational complexity. Lastly, S1 shows superior error performance at small SNR and reduced computational complexity.
