• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >On the User Selection for MIMO Broadcast Channels
【24h】

On the User Selection for MIMO Broadcast Channels

机译：关于MIMO广播信道的用户选择

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, a downlink communication system, in which a base station (BS) equipped with $M$ antennas communicates with $N$ users each equipped with $K$ receive antennas, is considered. An efficient suboptimum algorithm is proposed for selecting a set of users in order to maximize the sum–rate throughput of the system, in a Rayleigh-fading environment. For the asymptotic case when $N$ tends to infinity, the necessary and sufficient conditions in order to achieve the maximum sum–rate throughput, such that the difference between the achievable sum–rate and the maximum value approaches zero, is derived. The complexity of our algorithm is investigated in terms of the required amount of feedback from the users to the BS, as well as the number of searches required for selecting the users. It is shown that the proposed method is capable of achieving a large portion of the sum–rate capacity, with a very low complexity.
机译：在本文中，考虑了一种下行链路通信系统，其中配备有$ M $个天线的基站（BS）与每个都配备有$ K $个接收天线的$ N $个用户进行通信。提出了一种有效的次优算法，用于选择一组用户，以便在瑞利衰落环境中最大化系统的总吞吐量。对于$ N $趋于无穷大的渐近情况，得出了达到最大求和速率吞吐量的必要条件和充分条件，使得可实现的求和速率与最大值之差接近零。我们根据从用户到BS的所需反馈量以及选择用户所需的搜索次数来研究算法的复杂性。结果表明，所提出的方法能够以较低的复杂度实现很大一部分求和率容量。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号