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

利用通道知识图谱进行存在位置不确定性下的多用户分层波束成形

Leveraging Channel Knowledge Map for Multi-User Hierarchical Beam Training Under Position Uncertainty

Department of Electronic Engineering, Tsinghua University(清华大学电子工程系)

Xu Shi, Haohan Wang, Yashuai Cao, Hengyu Zhang, Sufang Yang, Jintao Wang

AI总结:

本文提出基于通道知识图谱的多用户分层波束成形框架,通过整合位置信息和CKM,解决位置不确定性下的波束成形问题,提升6G网络性能。

摘要:

通道知识图谱(CKM)作为一种获取位置特定信道信息的有前景的框架,无需消耗无线资源,为先进的无线网络设计和优化开辟了新天地。尽管其潜力巨大,但CKM在波束成形中的实际应用仍面临诸多挑战。一方面,在波束成形之前,用户的确切位置通常不可用,这限制了CKM的实用性,因为其效果严重依赖于准确的位置数据输入。另一方面,CKM、实时观测和训练策略之间的复杂相互作用尚未被深入研究,导致性能低下和实际实施困难。在本文中,我们提出了一种CKM辅助的波束成形框架,以解决这些限制。对于单用户场景,我们提出了一种以奖励为导向的波束潜力分层策略,该策略整合了部分位置信息和CKM。该策略建模了用户设备(UE)位置不确定性,并将分层搜索过程建模为修剪后的二叉搜索树。通过评估潜在码字的权重和奖励,推导出一种具有最小开销的最优分层搜索策略。此外,设计了一种低复杂度的双层前瞻方案,以平衡开销和计算需求。对于多用户场景,我们开发了一种相关性驱动的位置修剪训练方案,其中利用来自用户间干扰的旁瓣增益来提供额外的侧信息以减少开销,使所有用户能够同时分配各自的支持波束。仿真验证了所提出方法在推进6G波束成形方面的优越性能。

英文摘要:

Channel knowledge map (CKM) emerges as a promising framework to acquire location-specific channel information without consuming wireless resources, creating new horizons for advanced wireless network design and optimization. Despite its potential, the practical application of CKM in beam training faces several challenges. On one hand, the user's precise location is typically unavailable prior to beam training, which limits the utility of CKM since its effectiveness relies heavily on accurate input of position data. On the other hand, the intricate interplay among CKM, real-time observations, and training strategies has not been thoroughly studied, leading to suboptimal performance and difficulties in practical implementation. In this paper, we present a framework for CKM-aided beam training that addresses these limitations. For single-user scenario, we propose a reward-motivated beam-potential hierarchical strategy which integrates partial position information and CKM. This strategy models the user equipment (UE) position uncertainty and formulates the hierarchical searching process as a pruned binary search tree. An optimal hierarchical searching strategy with minimal overhead is derived by evaluating the weights and rewards of potential codewords. Furthermore, a low-complexity two-layer lookahead scheme is designed to balance overhead and computational demands. For multi-user scenario, we develop a correlation-driven position-pruning training scheme, where sidelobe gains from inter-user interference are exploited to provide additional side information for overhead reduction, allowing all users to be simultaneously assigned their respective supportive beams. Simulations validate the superior performances of proposed approaches in advancing 6G beam training.

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

↑