MU-MIMO Beamforming With Limited Channel Data Samples

被引:1
作者
Li, Shaoran [1 ]
Jiang, Nan [2 ]
Chen, Yongce [1 ]
Xie, Weijun [2 ]
Lou, Wenjing [3 ]
Hou, Y. Thomas [3 ]
机构
[1] NVIDIA Corp, Santa Clara, CA 95051 USA
[2] Georgia Tech, Atlanta, GA 30332 USA
[3] Virginia Tech, Blacksburg, VA 24061 USA
关键词
Channel uncertainty; chance-constrained programming; data samples; 5G; MU-MIMO; beamforming; DOWNLINK; DESIGN; OPTIMIZATION; PERFORMANCE; RECIPROCITY; NETWORKS; CAPACITY; SYSTEMS;
D O I
10.1109/JSAC.2024.3431515
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Channel State Information (CSI) is a critical piece of information for MU-MIMO beamforming. However, CSI estimation errors are inevitable in practice. The random and uncertain nature of CSI estimation errors poses significant challenges to MU-MIMO beamforming. State-of-the-art works addressing such a CSI uncertainty can be categorized into model-based and data-driven works, both of which have limitations when providing a performance guarantee to the users. In contrast, this paper presents Limited Sample-based Beamforming (LSBF)-a novel approach to MU-MIMO beamforming that only uses a limited number of CSI data samples (without assuming any knowledge of channel distributions). Thanks to the use of CSI data samples, LSBF enjoys flexibility similar to data-driven approaches and can provide a theoretical guarantee to the users-a major strength of model-based approaches. To achieve both, LSBF employs chance-constrained programming (CCP) and utilizes the $\infty $ -Wasserstein ambiguity set to bridge the unknown CSI distribution with limited CSI samples. Through problem decomposition and a novel bilevel formulation for each subproblem based on limited CSI data samples, LSBF solves each subproblem with a binary search and convex approximation. We show that LSBF significantly improves the network performance while providing a probabilistic data rate guarantee to the users.
引用
收藏
页码:3032 / 3047
页数:16
相关论文
共 55 条
[1]  
5G
[2]  
NR, 2024, Standard TS 38.214
[3]   A Survey on Hybrid Beamforming Techniques in 5G: Architecture and System Model Perspectives [J].
Ahmed, Irfan ;
Khammari, Hedi ;
Shahid, Adnan ;
Musa, Ahmed ;
Kim, Kwang Soon ;
De Poorter, Eli ;
Moerman, Ingrid .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2018, 20 (04) :3060-3097
[4]   Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs [J].
Ahmed, Shabbir ;
Luedtke, James ;
Song, Yongjia ;
Xie, Weijun .
MATHEMATICAL PROGRAMMING, 2017, 162 (1-2) :51-81
[5]   Neural Networks Based Beam Codebooks: Learning mmWave Massive MIMO Beams That Adapt to Deployment and Hardware [J].
Alrabeiah, Muhammad ;
Zhang, Yu ;
Alkhateeb, Ahmed .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2022, 70 (06) :3818-3833
[6]  
[Anonymous], 2024, document TR 36.931
[7]  
[Anonymous], 2024, documentTS38.211
[8]  
Ben-Tal A ..., 2001, Lectures on Modern Convex Optimization:Analysis, Algorithms, and Engineering Applications, P203
[9]   The ∞-Wasserstein distance:: Local solutions and existence of optimal transport maps [J].
Champion, Thierry ;
De Pascale, Luigi ;
Juutinen, Petri .
SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 2008, 40 (01) :1-20
[10]   Approximation bounds for semidefinite relaxation of max-min-fair multicast transmit beamforming problem [J].
Chang, Tsung-Hui ;
Luo, Zhi-Quan ;
Chi, Chong-Yung .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (08) :3932-3943