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

ISAC波束成形的最优低维结构:理论与高效算法

Optimal Low-Dimensional Structures of ISAC Beamforming: Theory and Efficient Algorithms

The Chinese University of Hong Kong(香港中文大学);The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳));Shenzhen Research Institute of Big Data(深圳大数据研究院);Beijing University of Posts and Telecommunications(北京邮电大学);Tongji University(同济大学)

Xiaotong Zhao, Mian Li, Ya-Feng Liu, Qingjiang Shi, Anthony Man-Cho So

AI总结:

本文提出了一种基于低维结构的ISAC波束成形理论与高效算法,通过减少计算复杂度实现大规模MIMO场景下的高速优化。

摘要:

在集成感知与通信(ISAC)系统中,发射波束成形设计是一个基础问题。已提出多种方法共同优化关键性能指标,如信干噪比和Cramér-Rao界。然而,这些方法的计算复杂度往往随着基站(BS)天线数量的增加而迅速增长。为解决这一挑战,我们证明了ISAC波束成形问题存在一个最优解,其具有低维结构。这导致了问题的等效重述,其维度与用户数量相关,而非基站天线数量,从而使得开发低复杂度算法成为可能。当将内部点方法应用于重述的问题时,当天线数量超过用户数量一个数量级时,复杂度可减少多达六个数量级。为进一步降低复杂度,我们开发了一种平衡增广拉格朗日方法来解决重述的问题。所提出的算法在保持最优性的同时,其计算复杂度与用户数量呈四次方关系。我们的仿真结果表明,所提出的R-BAL方法在大规模MIMO场景中,相对于传统IPM可实现超过10000倍的加速。

英文摘要:

Transmit beamforming design is a fundamental problem in integrated sensing and communication (ISAC) systems. Numerous methods have been proposed to jointly optimize key performance metrics such as the signal-to-interference-plus-noise ratio and Cramér-Rao bound. However, the computational complexity of these methods often grows rapidly with the number of transmit antennas at the base station (BS). To tackle this challenge, we prove a fundamental structural property of the ISAC beamforming problem, i.e., there exists an optimal solution exhibiting a low-dimensional structure. This leads to an equivalent reformulation of the problem with dimension related to the number of users rather than the number of BS antennas, thereby enabling the development of low-complexity algorithms. When applying the interior-point method to the reformulated problem, we achieve up to six orders of magnitude in complexity reduction when the number of antennas exceeds the number of users by an order of magnitude. To further reduce the complexity, we develop a balanced augmented Lagrangian method to solve the reformulated problem. The proposed algorithm maintains optimality while achieving a computational complexity that scales quartically with the number of users. Our simulation results demonstrate that the proposed R-BAL method can achieve a speedup of more than 10000$\times$ over the conventional IPM in massive MIMO scenarios.

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

↑