• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Annual Conference on Wireless On-demand Network Systems and Services >Novel combinatorial results on downlink MU-MIMO scheduling with applications
【24h】

Novel combinatorial results on downlink MU-MIMO scheduling with applications

机译：下行MU-MIMO调度新组合结果及应用

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper we consider the classical problem of downlink (DL) multiuser (MU) multi-input-multi-output (MIMO) scheduling with linear transmit precoding. This problem was formulated over a decade ago and has been deeply studied since then. Moreover, MU-MIMO with linear transmit precoding is being increasingly pursued as a key technology by the industry, with a strong emphasis on efficient scheduling algorithms. However, the intractable combinatorial nature of the problem has mostly restricted algorithm design to the realm of simple greedy heuristics. Such algorithms do not exploit any underlying structure in the problem. Recently, it has been formally shown that in general this problem is even hard to approximate. Our significant contribution in this work is to consider the practically most important choices of linear precoding and power allocation and show that the resulting problems can be cast as ones where a difference of two submodular set functions has to be maximized. This opens up a new framework for MU-MIMO scheduler design. We use this framework to design an algorithm and demonstrate that significant gains can be achieved at a reasonable complexity. Our framework can also incorporate analog receive beamforming which is deemed to be essential in mmWave MIMO systems.
机译：在本文中，我们考虑了具有线性发射预编码的下行链路（DL）多用户（MU）多输入多输出（MIMO）调度的经典问题。这个问题是在十多年前提出的，从那以后就进行了深入研究。此外，具有线性发射预编码的MU-MIMO正日益被业界视为一项关键技术，并高度重视高效的调度算法。然而，问题的难以解决的组合性质将算法设计主要限制在简单贪婪启发式算法的领域。这样的算法不会利用问题中的任何底层结构。近来，已经正式表明，一般来说，这个问题甚至很难估计。我们在这项工作中的重要贡献是考虑了线性预编码和功率分配的实际上最重要的选择，并表明所产生的问题可以看作是两个子模块集函数之差必须最大化的问题。这为MU-MIMO调度器设计打开了一个新框架。我们使用该框架设计算法，并证明可以在合理的复杂度下实现显着的收益。我们的框架还可以包含模拟接收波束成形，这在mmWave MIMO系统中被认为是必不可少的。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号