Low complexity user scheduling algorithms for uplink multiuser MIMO systems |
| |
Authors: | LI Liang QIU Ling and WEI Guo |
| |
Affiliation: | Wireless Information Network Laboratory, University of Science and Technology of China, Hefei 230027, China |
| |
Abstract: | 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. |
| |
Keywords: | Genetic algorithm (GA) multiuser scheduling multiple input multiple output (MIMO) |
本文献已被 CNKI 维普 万方数据 等数据库收录! |
| 点击此处可从《哈尔滨工业大学学报(英文版)》浏览原始摘要信息 |
|
点击此处可从《哈尔滨工业大学学报(英文版)》下载全文 |