Abstract
This paper discusses the scaling laws of sum capacity for simple user selection algorithm in MIMO broadcast channels. We present an efficient user selection algorithm, named as simple user selection algorithm (or just simple algorithm). This algorithm is based on the top N_{I} users selected from N_{u} total users in the system. The asymptotic behavior of throughput for MUMIMO BC (Multi User MIMO Broadcast) system with simple algorithm is studied. It is shown that the upper bound on sum capacity remains unchanged as that of DPC (Dirty Paper Coding). The simple algorithm takes N_{I} largest power users, reducing the search subset for scheduling from N_{u} to N_{I} , while achieving the same upper bound. This is an important result in the large number of users regime (or devices for IoT scenario) where users try to get the scared communication resource. In the end, we showed that by reducing the search subset does not reduce the degrees of freedom in the system.
Original language  English 

Title of host publication  Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019 
Editors  Arturs Aboltins, Anna Litvinenko 
Place of Publication  United States 
Publisher  IEEE, Institute of Electrical and Electronics Engineers 
Pages  7681 
Number of pages  6 
ISBN (Electronic)  9781728144733 
DOIs  
Publication status  Published  14 Nov 2019 
Event  2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019  Scientific Library of Riga Technical University, Riga, Latvia Duration: 01 Oct 2019 → 02 Oct 2019 http://mttw.org/ http://mttw.org/program.php (full program) https://ieeexplore.ieee.org/xpl/conhome/8891845/proceeding (proceedings) 
Publication series
Name  Proceedings of 2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019 

Conference
Conference  2019 IEEE Microwave Theory and Techniques in Wireless Communications, MTTW 2019 

Country  Latvia 
City  Riga 
Period  01/10/19 → 02/10/19 
Internet address 
