...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Signal Processing >On Downlink Beamforming With Greedy User Selection: Performance Analysis and a Simple New Algorithm
【24h】

On Downlink Beamforming With Greedy User Selection: Performance Analysis and a Simple New Algorithm

机译：带有贪婪的用户选择的下行链路波束成形：性能分析和一种简单的新算法

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

摘要

This paper considers the problem of simultaneous multiuser downlink beamforming. The idea is to employ a transmit antenna array to create multiple "beams" directed toward the individual users, and the aim is to increase throughput, measured by sum capacity. In particular, we are interested in the practically important case of more users than transmit antennas, which requires user selection. Optimal solutions to this problem can be prohibitively complex for online implementation at the base station and entail so-called Dirty Paper (DP) precoding for known interference. Suboptimal solutions capitalize on multiuser (selection) diversity to achieve a significant fraction of sum capacity at lower complexity cost. We analyze the throughput performance in Rayleigh fading of a suboptimal greedy DP-based scheme proposed by Tu and Blum. We also propose another user-selection method of the same computational complexity based on simple zero-forcing beamforming. Our results indicate that the proposed method attains a significant fraction of sum capacity and throughput of Tu and Blum's scheme and, thus, offers an attractive alternative to DP-based schemes.
机译：本文考虑了同时多用户下行链路波束成形的问题。这个想法是采用发射天线阵列来创建指向各个用户的多个“波束”，目的是增加通过总容量衡量的吞吐量。尤其是，我们对用户比发送天线更多的用户这一实际重要案例感兴趣，这需要用户选择。对于该问题的最佳解决方案在基站上的在线实现可能会非常复杂，并且需要针对已知干扰进行所谓的脏纸（DP）预编码。次优解决方案利用多用户（选择）多样性，以较低的复杂性成本实现了很大一部分总容量。我们分析了Tu和Blum提出的基于次优贪婪DP方案的瑞利衰落中的吞吐量性能。我们还提出了另一种基于简单的迫零波束成形的具有相同计算复杂度的用户选择方法。我们的结果表明，所提出的方法在Tu和Blum方案的总容量和吞吐量中获得了很大一部分，因此为基于DP的方案提供了有吸引力的替代方案。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号