论文标题
干扰束的束对准,以通过内核匪徒进行时变通道
Interference Constrained Beam Alignment for Time-Varying Channels via Kernelized Bandits
论文作者
论文摘要
为了充分利用毫米波(MMWave)中丰富的光谱资源,对于大型天线阵列而言,必须使用梁对准(BA)才能实现大阵列。在实用的动态无线环境中,由于时间变化和多径效应,渠道建模具有挑战性。在本文中,我们将梁对准问题提出为非平稳的在线学习问题,目的是在干扰约束下最大化接收的信号强度。特别是,我们采用非平稳的内核匪徒来利用光束之间的相关性,并建模复杂的光束形成和多径通道函数。此外,为了减轻对其他用户设备的干扰,我们利用原始偶的方法来设计受约束的UCB型内核化强盗算法。我们的理论分析表明,所提出的算法可以在时间变化的环境中自适应地调节光束,从而使收到的信号的累积遗憾和约束违规均具有相对于时间的斜线界限。对于适应性定价和新闻排名等应用程序,该结果具有独立的兴趣。此外,该算法假定该通道是一个黑框函数,并且不需要任何先验知识进行动态通道建模,因此适用于各种情况。我们进一步表明,如果已知有关通道变化的信息,则该算法将具有更好的理论保证和性能。最后,我们进行模拟以突出提出的算法的有效性。
To fully utilize the abundant spectrum resources in millimeter wave (mmWave), Beam Alignment (BA) is necessary for large antenna arrays to achieve large array gains. In practical dynamic wireless environments, channel modeling is challenging due to time-varying and multipath effects. In this paper, we formulate the beam alignment problem as a non-stationary online learning problem with the objective to maximize the received signal strength under interference constraint. In particular, we employ the non-stationary kernelized bandit to leverage the correlation among beams and model the complex beamforming and multipath channel functions. Furthermore, to mitigate interference to other user equipment, we leverage the primal-dual method to design a constrained UCB-type kernelized bandit algorithm. Our theoretical analysis indicates that the proposed algorithm can adaptively adjust the beam in time-varying environments, such that both the cumulative regret of the received signal and constraint violations have sublinear bounds with respect to time. This result is of independent interest for applications such as adaptive pricing and news ranking. In addition, the algorithm assumes the channel is a black-box function and does not require any prior knowledge for dynamic channel modeling, and thus is applicable in a variety of scenarios. We further show that if the information about the channel variation is known, the algorithm will have better theoretical guarantees and performance. Finally, we conduct simulations to highlight the effectiveness of the proposed algorithm.