Abstract
The problem of user scheduling with reduced overhead of channel estimation in the uplink of massive multiple-input multiple-output (MIMO) systems has been investigated. The authors consider the COST 2100 channel model. In this paper, they first propose a new user selection algorithm based on knowledge of the geometry of the service area and location of clusters, without having full channel state information at the BS. They then show that the correlation in geometry-based stochastic channel models (GSCMs) arises from the common clusters in the area. In addition, exploiting the closed-form Cramer–Rao lower bounds, the analysis for the robustness of the proposed scheme to cluster position errors is presented. It is shown by analysing the capacity upper bound that the capacity strongly depends on the position of clusters in the GSCMs and users in the system. Simulation results show that though the BS receiver does not require the channel information of all users, by the proposed geometry-based user scheduling algorithm the sum rate of the system is only slightly less than the well known greedy weight clique scheme.
Highlights
Massive multiple-input multiple-output (MIMO) is a promising technique to achieve high data rate [1]-[3]
High performance multiuser MIMO (MU-MIMO) uplink techniques rely on the availability of full channel state information (CSI) of all user terminals at the base station (BS) receiver, which presents a major challenge to their practical implementation
A square cell with a side length of 2 × R has been considered so that we call R the cell size and assume users are uniformly distributed in the cell
Summary
Massive multiple-input multiple-output (MIMO) is a promising technique to achieve high data rate [1]-[3]. High performance multiuser MIMO (MU-MIMO) uplink techniques rely on the availability of full channel state information (CSI) of all user terminals at the base station (BS) receiver, which presents a major challenge to their practical implementation. An important issue in Massive MIMO systems is investigating user scheduling in which multiuser diversity gain with imperfect CSI is considered [8]. A range of user scheduling schemes have been proposed for large MIMO systems. Most of these, such as that described in [9], require accurate knowledge of the channel from all potential users to the BS -which in the frequency division duplex (FDD) Massive MIMO case is completely infeasible to obtain. In this paper we focus on a simplified and robust user scheduling algorithm, by considering Massive MIMO simplifications and the effect of the cell geometry
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
