arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1810.06150cs.ITmath.IT
收藏

mmWave高速训练通信中的强盗启发波束搜索方案

Bandit Inspired Beam Searching Scheme for mmWave High-Speed Train Communications

Jun-Bo Wang, Ming Cheng, Jin-Yuan Wang, Min Lin, Yongpeng Wu, Huiling Zhu, Jiangzhou Wang

摘要:

高速列车(HST)正在世界各地广泛部署。为了满足高速传输系统的高速率数据传输需求,毫米波高速传输系统受到了越来越多的关注。为了实现足够的链路裕度,毫米波HST系统采用具有大天线阵列的定向波束形成,这导致信道估计相当耗时。在HST场景中,信道条件快速变化,并且应当频繁地执行信道估计。由于每个传输时间间隔(TTI)的周期太短而不能分配足够的时间用于精确的信道估计,因此关键挑战是如何设计有效的波束搜索方案以留出更多的时间用于数据传输。受机器学习成功应用的启发,本文试图利用当前和历史无线传播环境之间的相似性。利用强化学习的知识,将毫米波HST通信的波束搜索问题转化为多臂强盗(MAB)问题,提出了一种强盗启发波束搜索方案,以尽可能减少测量次数.与流行的深度学习方法不同,该方案不需要事先收集和存储大量的训练数据,可以节省大量的存储空间、计算时间和电能等资源。此外,所提出的计划的性能进行了分析的遗憾。遗憾分析表明,所提出的方案可以很快接近理论极限,仿真结果进一步验证了这一点。

英文摘要:

High-speed trains (HSTs) are being widely deployed around the world. To meet the high-rate data transmission requirements on HSTs, millimeter wave (mmWave) HST communications have drawn increasingly attentions. To realize sufficient link margin, mmWave HST systems employ directional beamforming with large antenna arrays, which results in that the channel estimation is rather time-consuming. In HST scenarios, channel conditions vary quickly and channel estimations should be performed frequently. Since the period of each transmission time interval (TTI) is too short to allocate enough time for accurate channel estimation, the key challenge is how to design an efficient beam searching scheme to leave more time for data transmission. Motivated by the successful applications of machine learning, this paper tries to exploit the similarities between current and historical wireless propagation environments. Using the knowledge of reinforcement learning, the beam searching problem of mmWave HST communications is formulated as a multi-armed bandit (MAB) problem and a bandit inspired beam searching scheme is proposed to reduce the number of measurements as many as possible. Unlike the popular deep learning methods, the proposed scheme does not need to collect and store a massive amount of training data in advance, which can save a huge amount of resources such as storage space, computing time, and power energy. Moreover, the performance of the proposed scheme is analyzed in terms of regret. The regret analysis indicates that the proposed schemes can approach the theoretical limit very quickly, which is further verified by simulation results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑