Weighted Sum Rate Maximization for the MIMO-Downlink Using a Projected Conjugate Gradient Algorithm
Weighted Sum Rate Maximization for the MIMO-Downlink Using a Projected Conjugate Gradient Algorithm
复制标题
DOI：
10.1109/iwcld.2007.4379043
复制
发表时间：
2007-11
期刊：
影响因子：
--
通讯作者：
R. Bohnke;K. Kammeyer
中科院分区：
文献类型：
--
作者：
R. Bohnke;K. Kammeyer
数据速率加权和的最大化是基于跨层的资源分配中的一个关键点。在文献中已经提出了几种算法来解决在基站使用脏纸预置的多天线系统的下行链路的问题。然而，如果考虑到目标函数评估的真实数量，它们的收敛速度都相对较慢。本文提出了一种改进的共轭梯度法，在搜索方向的计算中考虑了功率约束。通过对不同场景的蒙特卡罗仿真，验证了该方法优于已有方法的收敛特性。
The maximization of a weighted sum of data rates is an essential point in cross-layer based resource allocation. Several algorithms have been proposed in the literature to solve this problem for the downlink of a multiple antenna system employing dirty paper preceding at the base station. However, they all suffer from a relatively slow convergence if the true number of objective function evaluations is taken into account. In this paper, an improved conjugate gradient method is presented, that takes the power constraint into account in the calculation of the search direction. Its superior convergence properties compared to existing approaches are verified by Monte-Carlo simulations for various scenarios.