Practical Uplink Multi-User MIMO Scheduling Based on Iterative Heuristic Search

This paper proposes a low complexity scheduling for up-link multi-user multiple-input-multiple-output (MU-MIMO) that takes an approach of iterative heuristic search. The proposed scheduling randomly selects some of all the users in a cell, and searches the best combination of users in the possible combinations of the selected users for the MU-MIMO communication. The proposed scheduling iterates the above user search, while the best combination of the user is carried over to the user combination search at the next iteration. The performance of the proposed scheduling is evaluated in a three-dimensional wireless network by computer simulation. Even though the proposed scheduling can be implemented with approximately <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\frac{1}{100}$</tex> less complexity than the optimum scheduling which is regarded as a representative of conventional techniques, the performance of the proposed scheduling is shown to be near as superior as that of the optimum scheduling.