Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Low-Complexity Downlink User Selection for Massive MIMO Systems (1504.02990v1)

Published 12 Apr 2015 in cs.IT and math.IT

Abstract: In this paper we propose a pair of low-complexity user selection schemes with zero-forcing precoding for multiuser massive MIMO downlink systems, in which the base station is equipped with a large-scale antenna array. First, we derive approximations of the ergodic sum rates of the systems invoking the conventional random user selection (RUS) and the location-dependant user selection (LUS). Then, the optimal number of simultaneously served user equipments (UEs), $K*$, is investigated to maximize the sum rate approximations. Upon exploiting $K*$, we develop two user selection schemes, namely $K*$-RUS and $K*$-LUS, where $K*$ UEs are selected either randomly or based on their locations. Both of the proposed schemes are independent of the instantaneous channel state information of small-scale fading, therefore enjoying the same extremely-low computational complexity as that of the conventional RUS scheme. Moreover, both of our proposed schemes achieve significant sum rate improvement over the conventional RUS. In addition, it is worth noting that like the conventional RUS, the $K*$-RUS achieves good fairness among UEs.

Citations (42)

Summary

We haven't generated a summary for this paper yet.