• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Annual Allerton Conference on Communication, Control, and Computing; 20040929-1001; Monticello,IL(US) >Low Complexity Multiuser Scheduling for Maximizing Throughput in the MIMO Broadcast Channel
【24h】

Low Complexity Multiuser Scheduling for Maximizing Throughput in the MIMO Broadcast Channel

机译：低复杂度多用户调度，可最大化MIMO广播信道的吞吐量

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

摘要

We consider the general multiuser downlink scheduling problem with n receivers and m transmit antennas, where data from different users can be multiplexed. It is shown that there is a throughput-optimal policy which selects a subset of users to multiplex in each scheduling interval, according to their queue states and current rates achievable by dirty-paper coding. However, the computation of these rates and the selection of the best ordered subset has high complexity in n. It is observed that the simpler multiplexing method of zero-forcing can achieve close to optimal throughput especially when user rate demands are asymmetric. The strong dependence of the objective function with zero-forcing precoding on the queue sizes motivates an algorithm based on ordering users according to queues and making a selection out of a reduced set of users (typically a few multiples of m), which greatly reduces the computational complexity. It is shown that searching beyond this small set is unlikely to improve the objective function.
机译：我们考虑具有n个接收器和m个发射天线的一般多用户下行链路调度问题，其中可以复用来自不同用户的数据。结果表明，存在一种吞吐量优化策略，该策略根据用户的队列状态和脏纸编码可获得的当前速率，在每个调度间隔中选择要复用的用户子集。但是，这些速率的计算和最佳排序子集的选择在n中具有很高的复杂度。可以看出，更简单的零强制复用方法可以实现接近最佳吞吐量，尤其是在用户速率需求不对称的情况下。目标函数与强制零编码对队列大小的强烈依赖关系激发了一种算法，该算法基于根据队列对用户进行排序并从减少的用户集中（通常是m的几倍）进行选择，从而大大减少了计算复杂度。结果表明，搜索超出这个小集合不可能改善目标函数。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号