共 55 条
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
相关论文