首页> 外文期刊>Signal Processing, IEEE Transactions on >Multicell MISO Downlink Weighted Sum-Rate Maximization: A Distributed Approach
【24h】

Multicell MISO Downlink Weighted Sum-Rate Maximization: A Distributed Approach

机译:多小区MISO下行链路加权和速率最大化:一种分布式方法

获取原文
获取原文并翻译 | 示例

摘要

We develop an easy to implement distributed method for weighted sum-rate maximization (WSRMax) problem in a multicell multiple antenna downlink system. Unlike the recently proposed minimum weighted mean-squared error based algorithms, where at each iteration all mobile terminals needs to estimate the covariance matrices of their received signals, compute and feedback over the air certain parameters to the base stations (BS), our algorithm operates without any user terminal assistance. It requires only BS to BS signalling via reliable backhaul links (e.g., fiber, microwave links) and all required computation is performed at the BSs. The algorithm is based on primal decomposition and subgradient methods, where the original nonconvex problem is split into a master problem and a number of subproblems (one for each BS). A novel sequential convex approximation strategy is proposed to address the nonconvex master problem. In the case of subproblems, we adopt an existing iterative approach based on second-order cone programming and geometric programming. The subproblems are coordinated to find a (possibly suboptimal) solution to the master problem. Subproblems can be solved by BSs in a fully asynchronous manner, though the coordination between subproblems should be synchronous. Numerical results are provided to see the behavior of the algorithm under different degrees of BS coordination. They show that the proposed algorithm yields a good tradeoff between the implementation-level simplicity and the performance.
机译:我们为多小区多天线下行链路系统中的加权总和率最大化(WSRMax)问题开发了一种易于实现的分布式方法。与最近提出的基于最小加权均方误差的算法不同,该算法在每次迭代时,所有移动终端都需要估计其接收信号的协方差矩阵,通过空中计算并将某些参数反馈给基站(BS),我们的算法可以运行无需任何用户终端协助。它仅需要经由可靠的回程链路(例如,光纤,微波链路)的BS到BS的信令,并且所有所需的计算在BS处执行。该算法基于原始分解和次梯度方法,其中原始的非凸问题分为主问题和多个子问题(每个BS一个)。提出了一种新颖的顺序凸逼近策略,以解决非凸主问题。对于子问题,我们采用基于二阶锥规划和几何规划的现有迭代方法。协调子问题以找到主问题的(可能次优)解决方案。子问题可以由BS以完全异步的方式解决,尽管子问题之间的协调应该是同步的。提供数值结果以查看算法在不同程度的BS协调下的行为。他们表明,所提出的算法在实现级别的简单性和性能之间取得了很好的折衷。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号