Rudra: An Algorithm for Optimizing Spectrum Efficiency with Data Rate Guarantee in Next-G Communications
The limited spectrum and data-intensive applications in 5G/Next-G networks call for data rate guarantees for UEs with minimum spectrum usage. This problem is challenging due to the complexity of MU-MIMO system, unknown Channel State Information (CSI), and estimation errors. We propose Rudra, which aims to minimize spectrum usage while offering probabilistic guarantee for each UE’s data rate. The essence of Rudra is to employ Chance-Constrained Programming (CCP) by leveraging limited CSI samples. By reformulating the CCP into a deterministic one, Rudra offers an iterative solution that addresses Resource Block Group (RBG) allocation, Modulation and Coding Scheme (MCS) selection, and Beamforming (BF) design. Simulations show that Rudra can meet our design objective and outperforms a modified state-of-the-art algorithm.
Authors
- Wenjing Lou (ORCID: https://orcid.org/0000-0002-2421-4623)
- Shaoran Li (ORCID: https://orcid.org/0000-0002-2648-5478)
- Yubo Wu (ORCID: https://orcid.org/0000-0001-7731-4989)
- Y. Thomas Hou (ORCID: https://orcid.org/0000-0003-3716-5768)
- Nan Jiang (ORCID: https://orcid.org/0000-0003-4231-2179)
- Shiva Acharya
Institutions
- Georgia Institute of Technology (US)
- Nvidia (United States) (US)
- Virginia Tech (US)
Publication Details
- Published
- 2024-10-28
- DOI
- https://doi.org/10.1109/milcom61039.2024.10773760
- Citations
- 4
- Primary Topic
- Telecommunications and Broadcasting Technologies
- Type
- article
- Field-Weighted Citation Impact
- 1.28