首页> 外文会议>Annual Allerton Conference on Communication, Control, and Computing vol.1 >User Selection for MIMO Broadcast Channel with Sequential Water-Billing
【24h】

User Selection for MIMO Broadcast Channel with Sequential Water-Billing

机译:具有顺序计费功能的MIMO广播信道的用户选择

获取原文

摘要

In this paper, we propose a new suboptimal user selection method for the MIMO broadcast channel based on the sequential water-filling (SWF) algorithm. This algorithm is designed to maximize the sum rate of the zero-forcing beamforming (ZFBF) strategy. The reduction of complexity is achieved in a number of ways. First, an iterative procedure to calculate the Penrose-Moore inverse of the channel matrix, based on an LQ decomposition, is introduced. This procedure converts the matrix inversion operation to one vector-matrix multiplication. Secondly, the sequential nature of the user selection problem rules out the try-and-test phase for the water-filling approach. Finally, it is shown that the search space of this algorithm can be further pruned. Simulation demonstrates that this algorithm achieves a sum rate that is close to the maximal sum rate achievable by ZFBF, with a complexity that is comparable to the best algorithms known so far.
机译:在本文中,我们提出了一种基于顺序水填充(SWF)算法的MIMO广播信道的新的次优用户选择方法。该算法旨在最大化零强制波束形成(ZFBF)策略的总和率。以多种方式实现复杂性的降低。首先,介绍了基于LQ分解计算信道矩阵的PENROSE-MOORE逆的迭代过程。该过程将矩阵反转操作转换为一个向量矩阵乘法。其次,用户选择问题的顺序性质规定了用于水填充方法的试验阶段。最后,显示该算法的搜索空间可以进一步修剪。模拟表明,该算法实现了近距离ZFBF可实现的最大和速率的总和速率,其复杂性与到目前为止已知的最佳算法相当。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号