论文标题
加速的投影梯度方法,用于优化无细胞的大型MIMO下行链路
Accelerated Projected Gradient Method for the Optimization of Cell-Free Massive MIMO Downlink
论文作者
论文摘要
我们考虑一个无单元的大型多输入多输出(MIMO)系统的下行链路,其中大量访问点(AP)同时为一组用户服务。有趣的两个基本问题,即(i)最大化的总光谱效率(SE)和(ii),以最大程度地提高所有用户的最低SE。由于所考虑的问题是非凸的,因此现有的解决方案依赖于连续的凸近似来找到亚最佳解决方案。已知的方法使用基本实现内点算法的现成凸求解器来解决派生的凸问题。这种方法的主要问题是,它们的复杂性在问题大小上并不能占据良好性,将先前的研究限制为中等尺度的无细胞大规模mimo。因此,尚未完全理解无细胞的大型MIMO的潜力。为了解决这个问题,我们提出了一种加速的投影梯度方法来解决所考虑的问题。特别是,提出的解决方案是在封闭形式的表达式中找到的,仅需要目标的一阶信息,而不是像已知解决方案中的黑森州矩阵,因此记忆力更高。数值结果表明,与其他二阶方法相比,我们提出的解决方案的运行时间要少得多。
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.