首页> 外文会议>IEEE International Conference on Acoustics, Speech and Signal Processing >Stochastic Successive Weighted Sum-Rate Maximization for Multiuser MIMO Systems with Finite-Alphabet Inputs
【24h】

Stochastic Successive Weighted Sum-Rate Maximization for Multiuser MIMO Systems with Finite-Alphabet Inputs

机译:具有有限字母输入的多用户MIMO系统的随机连续加权和速率最大化

获取原文

摘要

Weighted sum-rate maximization (WSRM) is a fundamental problem for multiuser multiple-input-multiple-output (MU- MIMO) systems with finite-alphabet inputs. However, solving this problem is challenging because of the intractable expectation involved in rate functions. The state-of-art WSRM methods for the case of finite-alphabet inputs suffer from high computational complexity due to the issue of complicated numerical integrals for expectation calculation. Inspired by the stochastic successive upper-bound minimization (SSUM) method [1], this paper proposes a stochastic successive inexact lower-bound maximization (SSILM) algorithm for the WSRM problem with finite-alphabet inputs. Our algorithm significantly differs from SSUM in that we use an inexact lower bound of the objective function which is skillfully devised based on an exact but extremely loose lower bound of the objective function. Simulation results show that the proposed algorithm exhibits much faster convergence than state-of-art algorithms.
机译:加权和速率最大化(WSRM)是具有有限字母输入的多用户多输入多输出(MU-MIMO)系统的基本问题。但是,解决这个问题是挑战,因为速率函数涉及涉及的危害期望。由于对期望计算的复杂数量积分问题,用于有限字母输入的最先进的WSRM方法遭受高计算复杂性。灵感来自随机连续的上限最小化(SSUM)方法[1],本文提出了一种随机连续不精确的较大的最大限度的最大化(SSILM)算法,用于有限字母输入的WSRM问题。我们的算法显着不同于SSUM,因为我们使用目标函数的不精确下限,这巧妙地根据客观函数的精确但极其松散的下限进行巧妙地设计。仿真结果表明,所提出的算法表现出比最先进的算法更快的收敛。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号