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

网络式ISAC系统中前传压缩与波束成形的联合优化设计

Optimal Joint Fronthaul Compression and Beamforming Design for Networked ISAC Systems

Kexin Zhang, Yanqing Xu, Ruisi He, Chao Shen, Tsung-hui Chang

AI总结:

针对网络式ISAC系统的前传压缩与波束成形联合设计问题,证明压缩变量有闭式解,基于SDR与ISAC上下行对偶性提出高效原始-对偶算法,可在低复杂度下实现全局最优。

摘要:

本研究针对网络式集成感知与通信(integrated sensing and communication, ISAC)系统展开研究,该系统中多个基站(base stations, BSs)通过容量受限的前传链路连接至中央处理器(central processor, CP),在协同服务通信用户的同时对目标进行感知。研究的核心目标是在满足通信与感知的信干噪比(signal-to-interference-plus-noise ratio, SINR)要求、且受限于前传容量约束的前提下,最小化总发射功率,由此构建了前传压缩与波束成形联合设计(joint fronthaul compression and beamforming design, J-FCBD)问题。\n我们证明最优前传压缩变量可与波束成形向量一并通过闭式解确定,这是该领域的一项全新发现。基于这一结论,我们证明剩余的波束成形设计问题可通过半定松弛(semidefinite relaxation, SDR)技术求得全局最优解,不过该方法计算复杂度较高。此外,其SDR的紧性表明所研究问题与其拉格朗日对偶问题之间不存在对偶间隙。\n基于该对偶性结果,我们利用ISAC框架下全新的上下行(UL-DL)对偶性,提出了一种高效的基于原始-对偶(primal-dual, PD)的算法。该算法交替执行两个步骤:在对偶变量固定时通过不动点迭代求解波束成形问题,以及通过二分法更新对偶变量;由于每步迭代的计算成本极低,该算法既能保证全局最优性,又具备很高的效率。数值仿真结果验证了所提PD基算法的全局最优性、有效性与高效性。

英文摘要:

This study investigates a networked integrated sensing and communication (ISAC) system, where multiple base stations (BSs), connected to a central processor (CP) via capacity-limited fronthaul links, cooperatively serve communication users while simultaneously sensing a target. The primary objective is to minimize the total transmit power while meeting the signal-to-interference-plus-noise ratio (SINR) requirements for communication and sensing under fronthaul capacity constraints, resulting in a joint fronthaul compression and beamforming design (J-FCBD) problem. We demonstrate that the optimal fronthaul compression variables can be determined in closed form alongside the beamformers, a novel finding in this field. Leveraging this insight, we show that the remaining beamforming design problem can be solved globally using the semidefinite relaxation (SDR) technique, albeit with considerable complexity. Furthermore, the tightness of its SDR reveals zero duality gap between the considered problem and its Lagrangian dual. Building on this duality result, we exploit the novel UL-DL duality within the ISAC framework to develop an efficient primal-dual (PD)-based algorithm. The algorithm alternates between solving beamforming with a fixed dual variable via fixed-point iteration and updating dual variable via bisection, ensuring global optimality and achieving high efficiency due to the computationally inexpensive iterations. Numerical results confirm the global optimality, effectiveness, and efficiency of the proposed PD-based algorithm.

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

↑