Robust geometry-based user scheduling for large MIMO systems under realistic channel conditions

TY - GEN

T1 - Robust geometry-based user scheduling for large MIMO systems under realistic channel conditions

AU - Bashar, Manijeh

AU - Burr, Alister G.

AU - Maryopi, Dick

AU - Haneda, Katsuyuki

AU - Cumanan, Kanapathippillai

N1 - Funding Information: The work of A. G. Burr and K. Cumanan was supported by H2020-MSCA-RISE-2015 under grant number 690750. The work on which this paper is based was carried out in collaboration with COST Action CA15104 (IRACON). In addition, the work is supported by LPDP (Indonesia Endowment Fund for Education). Publisher Copyright: © 2018 VDE VERLAG GMBH.

PY - 2018

Y1 - 2018

N2 - The problem of user scheduling with reduced overhead of channel estimation in the uplink of Massive multipleinput multiple-output (MIMO) systems has been considered. A geometry-based stochastic channel model (GSCM), called the COST 2100 channel model has been used for realistic analysis of channels. In this paper, we 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 (CSI) at the base station (BS). The multiuser link correlation in the GSCMs arises from the common clusters in the area. The throughput depends on the position of clusters in the GSCMs and users in the system. Simulation results show that although the BS 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. Finally, the robustness of the proposed algorithm to the inaccuracy of cluster localization is verified by the simulation results.

AB - The problem of user scheduling with reduced overhead of channel estimation in the uplink of Massive multipleinput multiple-output (MIMO) systems has been considered. A geometry-based stochastic channel model (GSCM), called the COST 2100 channel model has been used for realistic analysis of channels. In this paper, we 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 (CSI) at the base station (BS). The multiuser link correlation in the GSCMs arises from the common clusters in the area. The throughput depends on the position of clusters in the GSCMs and users in the system. Simulation results show that although the BS 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. Finally, the robustness of the proposed algorithm to the inaccuracy of cluster localization is verified by the simulation results.

KW - Cluster localization

KW - COST 2100 channel model

KW - Geometry-based stochastic channel models

KW - Massive MIMO

KW - User scheduling

KW - Zero-forcing

UR - http://www.scopus.com/inward/record.url?scp=85050018579&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85050018579

T3 - 24th European Wireless 2018 "Wireless Futures in the Era of Network Programmability", EW 2018

SP - 242

EP - 247

BT - 24th European Wireless 2018 "Wireless Futures in the Era of Network Programmability", EW 2018

PB - VDE VERLAG GMBH

T2 - 24th European Wireless Conference 2018: Wireless Futures in the Era of Network Programmability, EW 2018

Y2 - 2 May 2018 through 4 May 2018

ER -