We consider a multi-user hybrid beamforming system, where the multiplexing gain is limited by the small number of RF chains employed at the base station (BS). To allow greater freedom for maximizing the multiplexing gain, it is better if the BS selects and serves some of the users at each scheduling instant, rather than serving all the users all the time. We adopt a two-timescale protocol that takes into account the mmWave characteristics, where at the long timescale an analog beam is chosen for each user, and at the short timescale users are selected for transmission based on the chosen analog beams. The goal of the user selection is to maximize the traditional Proportional Fair (PF) metric. However, this maximization is non-trivial due to interference between the analog beams for selected users. We first define a greedy algorithm and a "top-k" algorithm, and then propose a machine learning (ML)-based user selection algorithm to provide an efficient trade-off between the PF performance and the computation time. Throughout simulations, we analyze the performance of the ML-based algorithms under various metrics, and show that it gives an efficient trade-off in performance as compared to counterparts.
翻译:我们考虑多用户混合波束成型系统,即多路联动增益受基站(BS)使用的少量RF链的限制。为了允许更大的自由以最大限度地实现多路联动增益,如果BS在每次列表中选择和为一些用户服务,而不是随时为所有用户服务,就更好。我们采用一个考虑到毫米Wave特性的双尺度协议,在长时间尺度上为每个用户选择一个模拟波束,在短时间尺度上根据选定的模拟光束选择用户进行传输。用户选择的目的是尽量扩大传统的比例交易(PF)衡量标准。然而,由于对选定用户的模拟光束之间的干扰,这种最大化是非三维的。我们首先定义贪婪的算法和“顶K”算法,然后提出基于机器的用户选择算法,以便在PFP的性表现和计算时间之间进行高效的交换。在模拟过程中,我们分析基于ML的算法的性能,并显示在各种标准对等对等数据进行高效交易时的性能。