Pith. sign in

REVIEW

Low-Complexity Downlink User Selection for Massive MIMO Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1504.02990 v1 pith:7NMORPT6 submitted 2015-04-12 cs.IT math.IT

Low-Complexity Downlink User Selection for Massive MIMO Systems

classification cs.IT math.IT
keywords userselectionconventionalschemessystemsapproximationsdownlinklow-complexity
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.