首页> 美国卫生研究院文献>other >Low-Complexity User Selection for Rate Maximization in MIMO Broadcast Channels with Downlink Beamforming
【2h】

Low-Complexity User Selection for Rate Maximization in MIMO Broadcast Channels with Downlink Beamforming

机译:具有下行链路波束成形的MIMO广播信道中速率最大化的低复杂度用户选择

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

We present in this work a low-complexity algorithm to solve the sum rate maximization problem in multiuser MIMO broadcast channels with downlink beamforming. Our approach decouples the user selection problem from the resource allocation problem and its main goal is to create a set of quasiorthogonal users. The proposed algorithm exploits physical metrics of the wireless channels that can be easily computed in such a way that a null space projection power can be approximated efficiently. Based on the derived metrics we present a mathematical model that describes the dynamics of the user selection process which renders the user selection problem into an integer linear program. Numerical results show that our approach is highly efficient to form groups of quasiorthogonal users when compared to previously proposed algorithms in the literature. Our user selection algorithm achieves a large portion of the optimum user selection sum rate (90%) for a moderate number of active users.
机译:我们在这项工作中提出了一种低复杂度算法,以解决具有下行链路波束成形的多用户MIMO广播信道中的总速率最大化问题。我们的方法使用户选择问题与资源分配问题脱钩,其主要目标是创建一组准正交用户。所提出的算法利用了无线信道的物理量度,该物理量度可以容易地计算,从而可以有效地估计零空间投影功率。基于导出的度量,我们提供了一个数学模型,该模型描述了用户选择过程的动态过程,该过程将用户选择问题呈现为整数线性程序。数值结果表明,与文献中先前提出的算法相比,我们的方法可以高效地形成准正交用户组。对于中等数量的活动用户,我们的用户选择算法可实现大部分的最佳用户选择总和率(90%)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号