首页> 外文会议>IEEE International Conference on Acoustics, Speech, and Signal Processing >A CONVEX APPROXIMATION METHOD FOR MULTIUSER MISO SUM RATE MAXIMIZATION UNDER DISCRETE RATE CONSTRAINTS
【24h】

A CONVEX APPROXIMATION METHOD FOR MULTIUSER MISO SUM RATE MAXIMIZATION UNDER DISCRETE RATE CONSTRAINTS

机译:离散速率约束下的多用户差距速率最大化的凸逼近方法

获取原文

摘要

This paper considers a discrete sum rate maximization (DSRM) problem for transmit optimization in multiuser MISO downlink. Unlike many existing sum rate maximization designs, DSRM focuses on a scenario where each user's achievable rate can only be chosen from a given discrete rate set. This discrete rate-based design is motivated by the fact that practical communication systems can support only a finite number of combinations of modulation and coding schemes. We tackle the DSRM problem first by deriving a novel reformulation of DSRM, in which the discrete rate variables are absorbed by the objective function. Then, from this reformulation, an approximation algorithm based on convex optimization and iterative solution refinement is developed. Simulations results are provided to demonstrate the performance of the proposed algorithm compared with some state-of-the-art algorithms.
机译:本文考虑了在多用户杂项下行链路中传输优化的离散和速率最大化(DSRM)问题。与许多现有的总和速率最大化设计不同,DSRM专注于每个用户可实现的速率只能从给定的离散速率集中选择的场景。基于离散的速率的设计是由于实际通信系统只能支持的调制和编码方案的有限组合的事实。我们首先通过推导DSRM的新型重构来解决DSRM问题,其中离散速率变量被目标函数吸收。然后,从该重构中,开发了一种基于凸优化和迭代解决方案细化的近似算法。提供了模拟结果,以证明所提出的算法的性能与一些最先进的算法相比。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号