Low complexity user scheduling algorithms for uplink multiuser MIMO systems

This paper considers efficient and low complexity multiuser scheduling algorithms for the uplink multiple-input multiple-output systems. The exhaustive search algorithm (ESA) that gives the optimal performance, however, 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 problem: the improved genetic algorithm and simplified norm-based greedy algorithm. Numerical examples demonstrate that our proposed scheduling algorithms perform close to the optimal ESA, while with much lower complexity.