arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.03098cs.ITeess.SPmath.IT
收藏

一种数据与模型驱动的深度学习方法用于鲁棒下行波束成形优化

A Data and Model-Driven Deep Learning Approach to Robust Downlink Beamforming Optimization

Kai Liang, Gan Zheng, Zan Li, Kai-Kit Wong, Chan-Byoung Chae

AI总结:

本文提出一种基于无监督深度学习与模型驱动的鲁棒下行波束成形优化方法,利用图神经网络和二分搜索解决传统凸优化方法保守且复杂度高的问题,实现了更优的速率、能效与执行速度。

摘要:

本文研究了多用户多输入单输出(MISO)下行传输中存在信道不确定性的长期概率鲁棒发送波束成形优化问题。该问题带来了显著的分析与计算挑战。目前,最先进的优化方法依赖于将凸限制作为易处理的近似,以确保对高斯信道不确定性的鲁棒性。然而,该方法不仅计算复杂度高、存在秩松弛问题,而且产生的解较为保守。本文提出了一种基于无监督深度学习的方法,在训练过程中结合信道不确定性采样来优化概率系统性能。我们引入了一种模型驱动的学习方法,定义了带有可训练参数的新波束结构以应对信道不确定性。此外,我们采用图神经网络来高效推断关键波束参数。我们成功将该方法应用于中断和总功率约束下的最小速率分位数最大化问题。进一步地,我们提出了一种二分搜索方法,利用上述方法解决更具挑战性的带有概率速率约束的功率最小化问题。数值结果证实,与最先进的优化方法相比,我们的方法实现了非保守的鲁棒性能、更高的数据速率、更高的功率效率以及更快的执行速度。

英文摘要:

This paper investigates the optimization of the long-standing probabilistically robust transmit beamforming problem with channel uncertainties in the multiuser multiple-input single-output (MISO) downlink transmission. This problem poses significant analytical and computational challenges. Currently, the state-of-the-art optimization method relies on convex restrictions as tractable approximations to ensure robustness against Gaussian channel uncertainties. However, this method not only exhibits high computational complexity and suffers from the rank relaxation issue but also yields conservative solutions. In this paper, we propose an unsupervised deep learning-based approach that incorporates the sampling of channel uncertainties in the training process to optimize the probabilistic system performance. We introduce a model-driven learning approach that defines a new beamforming structure with trainable parameters to account for channel uncertainties. Additionally, we employ a graph neural network to efficiently infer the key beamforming parameters. We successfully apply this approach to the minimum rate quantile maximization problem subject to outage and total power constraints. Furthermore, we propose a bisection search method to address the more challenging power minimization problem with probabilistic rate constraints by leveraging the aforementioned approach. Numerical results confirm that our approach achieves non-conservative robust performance, higher data rates, greater power efficiency, and faster execution compared to state-of-the-art optimization methods.

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

↑