论文标题

有效的光束搜索使用协作过滤的初始访问

Efficient Beam Search for Initial Access Using Collaborative Filtering

论文作者

Yammine, George, Kontes, Georgios, Franke, Norbert, Plinge, Axel, Mutschler, Christopher

论文摘要

具有波束成形的天线阵列在较高的载波频率下克服了高空间路径损耗。但是,必须正确对齐梁,以确保用户设备(UE)辐射(并接收)最高功率。尽管有一些方法可以通过某种形式的层次搜索来详尽地搜索最佳光束,但它们可能很容易返回具有小光束增益的本地最佳解决方案。其他方法通过利用上下文信息来解决此问题,例如UE的位置或来自相邻基站(BS)的信息,但是计算和传达此其他信息的负担可能很高。迄今为止,基于机器学习的方法受到随附的培训,绩效监控和部署复杂性的影响,从而阻碍了他们的规模应用。 本文提出了一种解决初始梁发现问题的新方法。它是可扩展的,易于调整和实施。我们的算法基于推荐系统,该系统将基于培训数据集的组(即UES)和偏好(即来自代码簿中的光束)关联。每当需要提供新的UE时,我们的算法都会返回此用户群集中最好的光束。我们的仿真结果证明了我们方法的效率和鲁棒性,不仅在单个BS设置中,而且在需要几个BS之间协调的设置中。我们的方法在给定任务中始终优于标准基线算法。

Beamforming-capable antenna arrays overcome the high free-space path loss at higher carrier frequencies. However, the beams must be properly aligned to ensure that the highest power is radiated towards (and received by) the user equipment (UE). While there are methods that improve upon an exhaustive search for optimal beams by some form of hierarchical search, they can be prone to return only locally optimal solutions with small beam gains. Other approaches address this problem by exploiting contextual information, e.g., the position of the UE or information from neighboring base stations (BS), but the burden of computing and communicating this additional information can be high. Methods based on machine learning so far suffer from the accompanying training, performance monitoring and deployment complexity that hinders their application at scale. This paper proposes a novel method for solving the initial beam-discovery problem. It is scalable, and easy to tune and to implement. Our algorithm is based on a recommender system that associates groups (i.e., UEs) and preferences (i.e., beams from a codebook) based on a training data set. Whenever a new UE needs to be served our algorithm returns the best beams in this user cluster. Our simulation results demonstrate the efficiency and robustness of our approach, not only in single BS setups but also in setups that require a coordination among several BSs. Our method consistently outperforms standard baseline algorithms in the given task.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源