利用毫米波信道稀疏多径特性,提升波束对齐效率与鲁棒性。
Physics-Informed Parametric Bandits for Beam Alignment in mmWave Communications
- 基于信道稀疏多径特性设计物理感知波束搜索算法
- 在真实与合成数据集上均显著优于现有方法
- 适用于移动场景下的波束跟踪,通用性强
在毫米波通信中,波束对齐与追踪对于克服显著路径损耗至关重要。由于全方向扫描效率低下,设计高效且鲁棒的方法以识别最优波束方向十分关键。传统贝叶斯算法在大规模波束空间下收敛缓慢,许多现有工作依赖奖励函数的单峰或多重峰假设来提升效率,但这些假设在实际中往往不成立,导致算法收敛到次优波束。本文提出两种物理感知贝叶斯算法 pretc 与 prgreedy,利用毫米波信道稀疏多径这一普遍且现实的假设,该假设与相位恢复贝叶斯问题相关。算法将每条路径参数视为黑箱,基于历史采样奖励持续优化估计。pretc 先进行随机探索,再基于估计奖励函数选择最优波束;prgreedy 在线更新估计并即时选择当前最优波束。两者均可轻松扩展至移动场景下的波束追踪。通过在合成 DeepMIMO 数据集与真实 DeepSense6G 数据集上的实验,验证了两种算法在多种信道环境下均显著优于现有方法,展现出良好的泛化性与鲁棒性。
原文摘要 · Abstract (English)
In millimeter wave (mmWave) communications, beam alignment and tracking are crucial to combat the significant path loss. As scanning the entire directional space is inefficient, designing an efficient and robust method to identify the optimal beam directions is essential. Since traditional bandit algorithms require a long time horizon to converge under large beam spaces, many existing works propose efficient bandit algorithms for beam alignment by relying on unimodality or multimodality assumptions on the reward function's structure. However, such assumptions often do not hold (or cannot be strictly satisfied) in practice, which causes such algorithms to converge to choosing suboptimal beams. In this work, we propose two physics-informed bandit algorithms \textit{pretc} and \textit{prgreedy} that exploit the sparse multipath property of mmWave channels - a generic but realistic assumption - which is connected to the Phase Retrieval Bandit problem. Our algorithms treat the parameters of each path as black boxes and maintain optimal estimates of them based on sampled historical rewards. \textit{pretc} starts with a random exploration phase and then commits to the optimal beam under the estimated reward function. \textit{prgreedy} performs such estimation in an online manner and chooses the best beam under current estimates. Our algorithms can also be easily adapted to beam tracking in the mobile setting. Through experiments using both the synthetic DeepMIMO dataset and the real-world DeepSense6G dataset, we demonstrate that both algorithms outperform existing approaches in a wide range of scenarios across diverse channel environments, showing their generalizability and robustness.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。