five

Dataset for User Selection Algorithms for Block Diagonalization Aided Multiuser Downlink mm-Wave Communication

收藏
DataCite Commons2020-09-18 更新2025-04-17 收录
下载链接:
https://eprints.soton.ac.uk/406830/
下载链接
链接失效反馈
官方服务:
资源简介:
In order to meet the ever increasing datarate demands, the next generation of wireless communication systems is being designed for exploiting the large amounts of unused spectrum in the millimeter (mm) wave band. Since operating at mm-wave frequencies imposes several challenges, such as high path loss, as well as both spatial and temporal channel sparsity, there is a significant research interest focused on designing feasible solutions for establishing reliable and high-throughput links at mm-wave frequencies. In this paper, we consider a cellular system relying on hybrid beamforming aided basestation (BS) as well as user equipment and study the user selection problem, which has not been hitherto studied in the literature. More specifically, we study the problem of selecting $K^\prime$ users by the BS for communication out of $K$ users whilst ensuring that the sum rate is maximized. Specifically, we propose a user selection algorithm, which relies on the knowledge of both the channel gains and of the angle-of-departure (AoD) of the channel paths spanning to the various users, which is termed as the AoD aided user selection (AoD-US). Furthermore, we devise a pair of subspace metrics based on a) the angle between the subspaces spanned by the BS array response vectors; b) the ratio of interference and of the signal space dimensions of various users, in order to reduce the user search space in AoD-US. This modified user selection algorithm is termed as the AoD aided user selection with user set pruning (AoD-US-P). Furthermore, we study the attainable sum-rate performance of the block-diagonalization (BD) aided downlink and show that the proposed selection algorithms guarantee both multiuser diversity and multiplexing gains. Additionally, the proposed algorithms are studied in the round-robin (RR) scheduling scenario, where all the $K$ users are scheduled for achieving fairness. Our simulation results revealed that the AoD-US-P achieves nearly the same performance as that achieved by the AoD-US despite having a small user set, while both are observed to outperform the channel power based selection scheme.
提供机构:
University of Southampton
创建时间:
2017-03-23
5,000+
优质数据集
54 个
任务类型
进入经典数据集
二维码
社区交流群

面向社区/商业的数据集话题

二维码
科研交流群

面向高校/科研机构的开源数据集话题

数据驱动未来

携手共赢发展

商业合作