arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.04440eess.SP
收藏

无小区大规模多输入多输出下行链路优化的加速投影梯度法

Accelerated Projected Gradient Method for the Optimization of Cell-Free Massive MIMO Downlink

Muhammad Farooq, Hien Quoc Ngo, Le-Nam Tran

摘要:

我们考虑一个无小区的大规模多输入多输出(MIMO)系统的下行链路,大量的接入点(AP)同时服务于一组用户。两个基本问题是感兴趣的,即(i)最大化总频谱效率(SE),以及(ii)最大化所有用户的最小SE。由于所考虑的问题是非凸的,现有的解决方案依赖于逐次凸逼近找到一个次优解。已知的方法使用现成的凸解算器,其基本上实现了一个通道点算法,以解决导出的凸问题。这种方法的主要问题是,它们的复杂性并不与问题的大小有利地缩放,限制了以前的研究无小区大规模多输入多输出的中等规模。因此,无小区大规模多输入多输出的潜力尚未被完全理解。为了解决这个问题,我们提出了一个加速投影梯度方法来解决所考虑的问题。特别是,所提出的解决方案是在封闭形式的表达式,只需要一阶信息的目标,而不是在已知的解决方案的海森矩阵,因此是更有效的内存。数值结果表明,我们提出的解决方案实现了更少的运行时间,相比其他二阶方法。

英文摘要:

We consider the downlink of a cell-free massive multiple-input multiple-output (MIMO) system where large number of access points (APs) simultaneously serve a group of users. Two fundamental problems are of interest, namely (i) to maximize the total spectral efficiency (SE), and (ii) to maximize the minimum SE of all users. As the considered problems are non-convex, existing solutions rely on successive convex approximation to find a sub-optimal solution. The known methods use off-the-shelf convex solvers, which basically implement an interior-point algorithm, to solve the derived convex problems. The main issue of such methods is that their complexity does not scale favorably with the problem size, limiting previous studies to cell-free massive MIMO of moderate scales. Thus the potential of cell-free massive MIMO has not been fully understood. To address this issue, we propose an accelerated projected gradient method to solve the considered problems. Particularly, the proposed solution is found in closed-form expressions and only requires the first order information of the objective, rather than the Hessian matrix as in known solutions, and thus is much more memory efficient. Numerical results demonstrate that our proposed solution achieves far less run-time, compared to other second-order methods.

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

↑