Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 38 min ago
PreprintarXiv licencearXiv

GPU-Accelerated Robust Beamforming for OTFS Massive MIMO with CSI Uncertainty

Abstract

This paper focuses on robust beamforming for orthogonal time frequency space (OTFS)-enabled massive multiple-input multiple-output (MIMO) systems under channel state information (CSI) uncertainty. In high-mobility satellite communications, uncertain CSI severely degrades beamforming accuracy and poses a major challenge to meeting users' quality of service (QoS) requirements. To address this challenge, we first formulate a chance-constrained optimization problem aiming to minimize the total transmit power while guaranteeing a predefined outage probability. Building on a 3D delay-Doppler-angle (DDA) channel representation, we propose a data-driven approach using support vector clustering (SVC) to model the uncertain CSI as an asymmetric uncertainty set. We then derive a robust counterpart that reformulates the intractable chance constraints into a deterministic semidefinite program. Finally, we design a graphics processing unit (GPU)-accelerated parallelizable alternating direction method of multipliers (ADMM) algorithm to address the computational complexity of large-scale antenna arrays. Simulation results show that the proposed SVC-based design reduces transmit power compared with conventional beamforming schemes, and that the GPU-accelerated ADMM achieves a speedup. These results confirm that the proposed framework achieves improved robustness, energy efficiency, and efficient computation in dynamic massive MIMO networks.

Related

  1. GPU-Accelerated Robust MA--RIS Pre-Optimization for Communication and Target Illumination
    Tran Le Dung, Ho Viet Duc Luong
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  2. Adjustable Robust Optimization with Discrete Uncertainty
    Henri Lefebvre, Enrico Malaguti, Michele Monaci
    INFORMS Journal on ComputingPeer-reviewedLicence not statedFull text6 citedOptimisation & controlHAL
  3. Robust tests for log-normal lifetimes under cyclic-stress accelerated tests and interval monitoring
    María Jaenada, Leandro Pardo, Kiran Prajapat
    arXivPreprintCC BY-NC-ND 4.0Full textStatisticsarXiv
  4. Sparsity Regularized and Robust Mean Variance Portfolio Selection Under Ellipsoidal Uncertainty
    Deniz Akkaya, Emre Can Yayla, Buse Şen +1
    arXivPreprintCC BY 4.0Full textOptimisation & controlStatisticsarXiv
  5. Generalized Semi-Infinite Programming for Robust Optimal Control with Decision-Dependent Uncertainty
    J. Wehbeh, E. C. Kerrigan, E. Scaccia
    arXivPreprintCC BY-NC-ND 4.0Full textOptimisation & controlarXiv
BibTeX
@misc{zhang2026gpuaccelerated,
  title = {{GPU-Accelerated Robust Beamforming for OTFS Massive MIMO with CSI Uncertainty}},
  author = {Haonan Zhang and Weihua Wu},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.34763},
  eprint = {2609.34763},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.34763},
}
RIS
TY  - UNPB
TI  - GPU-Accelerated Robust Beamforming for OTFS Massive MIMO with CSI Uncertainty
AU  - Haonan Zhang
AU  - Weihua Wu
PY  - 2026
DA  - 2026/09/28
PB  - arXiv
DO  - 10.48550/arxiv.2609.34763
UR  - https://arxiv.org/abs/2609.34763
AB  - This paper focuses on robust beamforming for orthogonal time frequency space (OTFS)-enabled massive multiple-input multiple-output (MIMO) systems under channel state information (CSI) uncertainty. In high-mobility satellite communications, uncertain CSI severely degrades beamforming accuracy and poses a major challenge to meeting users' quality of service (QoS) requirements. To address this challenge, we first formulate a chance-constrained optimization problem aiming to minimize the total transmit power while guaranteeing a predefined outage probability. Building on a 3D delay-Doppler-angle (DDA) channel representation, we propose a data-driven approach using support vector clustering (SVC) to model the uncertain CSI as an asymmetric uncertainty set. We then derive a robust counterpart that reformulates the intractable chance constraints into a deterministic semidefinite program. Finally, we design a graphics processing unit (GPU)-accelerated parallelizable alternating direction method of multipliers (ADMM) algorithm to address the computational complexity of large-scale antenna arrays. Simulation results show that the proposed SVC-based design reduces transmit power compared with conventional beamforming schemes, and that the GPU-accelerated ADMM achieves a speedup. These results confirm that the proposed framework achieves improved robustness, energy efficiency, and efficient computation in dynamic massive MIMO networks.
ER  -