The Community for Technology Leaders
2015 13th International Conference on Frontiers of Information Technology (FIT) (2015)
Islamabad, Pakistan
Dec. 14, 2015 to Dec. 16, 2015
ISBN: 978-1-4673-9665-3
pp: 320-323
ABSTRACT
In multiuser MIMO systems, the spatial degrees of freedom can be effectively exploited to enhance system capacity by scheduling multiple users. This paper reviews multiuser MIMO communication from scheduling perspective, discussing performance gains, fairness, and computational complexity of leakage based scheduling algorithms. We consider well known scheduling algorithm based on user leakage power reported for MU-MIMO systems and analyze the selection criteria of first user and its impact on computational complexity of the algorithm. Through experimental validations, it is shown that if the first user is randomly selected the computational requirements are reduced with negligible performance loss. Computer simulations show that the proposed modification in the said algorithm reduces the complexity without degrading the performance.
INDEX TERMS
Scheduling algorithms, MIMO, Computational complexity, Interference, Computational modeling,Sumrate, Complexity, Fairness, MU-MIMO, Precoding
CITATION
Muddasar Naeem, Muhammad Usman Khan, Sajid Bashir, Aqeel A. Syed, "Modified Leakage Based User Selection for MU-MIMO Systems", 2015 13th International Conference on Frontiers of Information Technology (FIT), vol. 00, no. , pp. 320-323, 2015, doi:10.1109/FIT.2015.25
171 ms
(Ver 3.3 (11022016))