Fast Converging Algorithm for Weighted Sum Rate Maximization in Multicell MISO Downlink
Fast Converging Algorithm for Weighted Sum Rate Maximization in Multicell MISO Downlink
复制标题
DOI：
10.1109/lsp.2012.2223211
复制
发表时间：
2012-10
影响因子：
3.9
通讯作者：
Le-Nam Tran;M. F. Hanif;Antti Tölli;M. Juntti
中科院分区：
文献类型：
--
作者：
Le-Nam Tran;M. F. Hanif;Antti Tölli;M. Juntti
在多小区环境的下行链路中最大化加权和速率的问题是相当感兴趣的。不幸的是，这个问题被认为是NP难的。对于多天线基站和单天线移动的终端的情况下，我们设计了一个低复杂度，快速和可证明收敛的算法，局部优化系统的下行链路中的加权和速率。特别是，我们推导出一个迭代的二阶锥规划制定的加权和率最大化问题。该算法在几次迭代内收敛到局部最优。所提出的方法的上级性能建立通过数值比较它与其他已知的解决方案。
The problem of maximizing weighted sum rates in the downlink of a multicell environment is of considerable interest. Unfortunately, this problem is known to be NP-hard. For the case of multi-antenna base stations and single antenna mobile terminals, we devise a low complexity, fast and provably convergent algorithm that locally optimizes the weighted sum rate in the downlink of the system. In particular, we derive an iterative second-order cone program formulation of the weighted sum rate maximization problem. The algorithm converges to a local optimum within a few iterations. Superior performance of the proposed approach is established by numerically comparing it to other known solutions.