首页 | 本学科首页   官方微博 | 高级检索  
     

MIMO广播信道下的低复杂度多用户调度算法
引用本文:成功,周春晖,赵明,王京. MIMO广播信道下的低复杂度多用户调度算法[J]. 清华大学学报(自然科学版)网络.预览, 2007, 0(7)
作者姓名:成功  周春晖  赵明  王京
作者单位:清华大学电子工程系 北京100084
基金项目:国家自然科学基金资助项目(90204001)
摘    要:为了解决多输入多输出(MIMO)广播信道存在大尺度衰落条件下的多用户调度问题,该文将zero-forcing dirty-paper(ZF-DP)发送方案和最大权重匹配方法相结合,给出了一种时分的调度算法。在此基础上,采用用户排序和减小匹配搜索范围的方法,给出了两种简化算法,并且分析和比较了它们的复杂度。仿真结果表明:和相同发送方案下的线性最优调度相比,两种简化算法的性能差距不超过15%。而且它们的复杂度较低,易于实现,具有较高的实用价值。结果还为调度间隔、匹配搜索范围等参数的选择提供了参考。

关 键 词:移动通信  多输入多输出(MIMO)  多用户调度  最大权重匹配

Low complexity multi-user scheduling for MIMO broadcast channels
CHENG Gong,ZHOU Chunhui,ZHAO Ming,WANG Jing. Low complexity multi-user scheduling for MIMO broadcast channels[J]. , 2007, 0(7)
Authors:CHENG Gong  ZHOU Chunhui  ZHAO Ming  WANG Jing
Abstract:This paper presents a time-division multi-user scheduling algorithm for multiple-input multiple-output(MIMO)broadcast channels with large-scale fading which combines the zero-forcing dirty-paper(ZF-DP)transmit scheme with the maximum weight matching method.Two simplified algorithms were designed by sorting users and reducing the match search region.Simulations show that the performances of the simplified algorithms are reduced by less than 15% compared to optimal linear scheduling with the same transmit scheme.The algorithms have relatively low complexities and are quite practical.The simulation results also provided references for selection of parameters such as scheduling intervals and match search regions.
Keywords:mobile communication  multiple-input multiple-output(MIMO)  multi-user scheduling  maximum weight matching
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号