Low complexity user scheduling algorithms for uplink multiuser MIMO systems  

作　　者：李亮 邱玲 卫国 

机构地区：[1]Wireless Information Network Laboratory,University of Science and Technology of China

出　　处：《Journal of Harbin Institute of Technology(New Series)》2012年第2期105-112,共8页哈尔滨工业大学学报（英文版）

基　　金：Sponsored by the Technology Specific Project(Grant No. 2010ZX03002-003-01)

摘　　要：Two efficient and low complexity multiuser scheduling algorithms are proposed for the uplink multi- ple-input multiple-output systems in this paper. Conventionally, the exhaustive search algorithm （ESA） can give the optimal performance; however, it is complexity prohibitive for practical implementation. Aiming at re- ducing the complexity while keeping the achievable sum rate performance, two heuristic algorithms are proposed for the multiuser scheduling problems： the improved genetic algorithm and simplified norm-based greedy algo- rithm. Moreover, we also consider the heterogeneity scenario where a modified grouping-based user selection al- gorithm is given to guarantee the user＇ s fairness. Specifically, the asymptotic behavior of the norm-based greed- y algorithm is given when each user is equipped with one antenna. Numerical examples demonstrate the superi- ority of our proposed schedulin~ and ~rouoin~ algorithms.Two efficient and low complexity multiuser scheduling algorithms are proposed for the uplink multiple-input multiple-output systems in this paper.Conventionally,the exhaustive search algorithm(ESA) can give the optimal performance;however,it is complexity prohibitive for practical implementation.Aiming at reducing the complexity while keeping the achievable sum rate performance,two heuristic algorithms are proposed for the multiuser scheduling problems:the improved genetic algorithm and simplified norm-based greedy algorithm.Moreover,we also consider the heterogeneity scenario where a modified grouping-based user selection algorithm is given to guarantee the user's fairness.Specifically,the asymptotic behavior of the norm-based greedy algorithm is given when each user is equipped with one antenna.Numerical examples demonstrate the superiority of our proposed scheduling and grouping algorithms.

关 键 词：Genetic algorithm （GA） multiuser scheduling muhiple-input multiple-output （MIMO） 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TN919.81[自动化与计算机技术—计算机科学与技术]