Robust Transmission Design for RIS-Assisted High-Speed Train Communication Coverage Enhancement With Imperfect Cascaded Channels
Changzhu Liu, Ruisi He, Haoxiang Zhang, Jiahui Han, Ruifeng Chen, Bo Ai, and Zhangdui Zhong

TL;DR
This paper proposes a robust RIS-assisted high-speed train communication design that accounts for imperfect channel information, improving coverage and performance under realistic channel estimation errors.
Contribution
It introduces a robust optimization framework for RIS-assisted HST communication considering two types of CSI errors, enhancing reliability in practical high-speed scenarios.
Findings
CBRUB errors significantly impact system performance.
The proposed methods effectively handle worst-case and outage probability constraints.
Simulation results demonstrate improved coverage with robust design.
Abstract
Reconfigurable intelligent surface (RIS) has recently been gained attention as an effective technique improving the coverage and performance of communication systems by creating additional communication links. Deployment of RIS is crucial for overcoming signal coverage limitations, especially in high-speed train (HST) scenarios. Considerable research has been performed assuming perfect channel state information (CSI). However, due to the rapidly time-varying fading channels and feedback delays, achieving perfect CSI at the base station (BS) is not feasible in the HST scenarios. To tackle this problem, this paper investigates a robust design strategy for RIS-aided HST communication coverage enhancement, particularly focusing on cascaded BS-RIS-user channels at BS (CBRUB). The study explores the optimization problem under two types distinct of models: centered on minimizing transmit power…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
