首页> 外文期刊>Journal of the Korean Institute of Electromagnetic Engineering and Science >Low Complexity Multiuser Scheduling in Time-Varying MIMO Broadcast Channels
【24h】

Low Complexity Multiuser Scheduling in Time-Varying MIMO Broadcast Channels

机译:时变MIMO广播信道中的低复杂度多用户调度

获取原文
获取外文期刊封面目录资料

摘要

The sum-rate maximization rule can find an optimal user set that maximizes the sum capacity in multiple input multiple output (MIMO) broadcast channels (BCs), but the search space for finding the optimal user set becomes prohibitively large as the number of users increases. The proposed algorithm selects a user set of the largest effective channel norms based on statistical channel state information (CSI) for reducing the computational complexity, and uses Tomlinson-Harashima precoding (THP) for minimizing the interference between selected users in time-varying MIMO BCs.
机译:总和率最大化规则可以找到最佳用户集,该用户集可以最大化多输入多输出(MIMO)广播信道(BC)中的总容量,但是随着用户数量的增加,用于找到最佳用户集的搜索空间会变得过大。所提出的算法基于统计信道状态信息(CSI)选择最大有效信道范数的用户集以降低计算复杂度,并使用Tomlinson-Harashima预编码(THP)来使时变MIMO BC中所选用户之间的干扰最小化。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号