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

基于拉格朗日对偶的协作蜂窝网络联合波束形成与压缩问题的全局有效求解

Efficiently and Globally Solving Joint Beamforming and Compression Problem in the Cooperative Cellular Network via Lagrangian Duality

Xilai Fan, Ya-Feng Liu, Liang Liu

摘要:

考虑协作蜂窝网络中的联合波束成形和量化问题,其中多个中继类基站(BS)通过速率受限的前传链路连接到中央处理器(CP),协作地为用户服务。这个问题可以被公式化为总发射功率的最小化,服从所有用户的信号与干扰加噪声比(SINR)约束和所有中继类BS的前传速率约束。在本文中,我们首先表明,有没有考虑的问题和它的拉格朗日对偶之间的对偶间隙,显示所考虑的问题的半定松弛(SDR)的紧密性。然后,我们提出了一个有效的算法的基础上拉格朗日对偶求解所考虑的问题。该算法明智地利用了所考虑的问题的Karush-Kuhn-Tucker(KKT)条件的特殊结构,并通过两个不动点迭代找到满足KKT条件的解。所提出的算法是高效的(因为在两个固定点迭代中评估函数在计算上是便宜的),并保证找到问题的全局解。仿真结果表明了该算法的有效性和正确性。

英文摘要:

Consider the joint beamforming and quantization problem in the cooperative cellular network, where multiple relay-like base stations (BSs) connected to the central processor (CP) via rate-limited fronthaul links cooperatively serve the users. This problem can be formulated as the minimization of the total transmit power, subject to all users' signal-to-interference-plus-noise-ratio (SINR) constraints and all relay-like BSs' fronthaul rate constraints. In this paper, we first show that there is no duality gap between the considered problem and its Lagrangian dual by showing the tightness of the semidefinite relaxation (SDR) of the considered problem. Then we propose an efficient algorithm based on Lagrangian duality for solving the considered problem. The proposed algorithm judiciously exploits the special structure of the Karush-Kuhn-Tucker (KKT) conditions of the considered problem and finds the solution that satisfies the KKT conditions via two fixed-point iterations. The proposed algorithm is highly efficient (as evaluating the functions in both fixed-point iterations are computationally cheap) and is guaranteed to find the global solution of the problem. Simulation results show the efficiency and the correctness of the proposed algorithm.

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

↑