...
首页> 外文期刊>IEICE Transactions on Communications >Performance Analysis of the Extended Low Complexity User Scheduling Algorithm over Up-Link Multi-User MIMO OFDMA Systems
【24h】

Performance Analysis of the Extended Low Complexity User Scheduling Algorithm over Up-Link Multi-User MIMO OFDMA Systems

机译:上行多用户MIMO OFDMA系统上扩展的低复杂度用户调度算法的性能分析

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

The low complexity tree-structure based user scheduling algorithm is extended into up-link MLD-based multi-user multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing access (OFDMA) wireless systems. The system sum capacity is maximized by careful user selection on a defined tree structure. The calculation load is reduced by selecting the M most possible best branches and sampling in frequency dimension. The performances of the proposed scheduling algorithm are analyzed within three kinds of OFDMA systems and compared with conventional throughput-based algorithm. Both the theoretical analysis and simulation results show that the proposed algorithm obtains better performance with much low complexity.
机译:基于低复杂度树结构的用户调度算法被扩展到基于上行链路MLD的多用户多输入多输出(MIMO)正交频分复用接入(OFDMA)无线系统。通过在定义的树形结构上仔细选择用户,可以最大程度地提高系统总容量。通过选择M个最可能的最佳分支并在频率维度上采样,可以减少计算负担。在三种OFDMA系统中分析了所提出的调度算法的性能,并与传统的基于吞吐量的算法进行了比较。理论分析和仿真结果均表明,该算法具有较好的性能,且复杂度较低。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号