RECORD
Robust Geometry-Based User Scheduling for Large MIMO Systems Under Realistic Channel Conditions
Information Theory · Submitted 13 Jul 2017
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim 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.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
The problem of user scheduling with reduced overhead of channel estimation in the uplink of Massive multiple-input 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 multi-user 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.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | The problem of user scheduling with reduced overhead of channel estimation in the uplink of Massive multiple-input multiple-output (MIMO) systems has been considered. | background 1.00 | 0.14 | 0.03 | asserted 0.85 |
| s1 | A geometry-based stochastic channel model (GSCM), called the COST 2100 channel model has been used for realistic analysis of channels. | method 0.93 | 0.26 | 0.02 | asserted 1.00 |
| s2 | 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). | contribution 0.97 | 0.91 | 0.13 | asserted 1.00 |
| s3 | The multi-user link correlation in the GSCMs arises from the common clusters in the area. | background 0.95 | 0.17 | 0.03 | asserted 1.00 |
| s4 | The throughput depends on the position of clusters in the GSCMs and users in the system. | background 0.67 | 0.36 | 0.05 | asserted 1.00 |
| s5 | 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. | result 1.00 | 0.95 | 0.76 | asserted 1.00 |
| s6 | Finally, the robustness of the proposed algorithm to the inaccuracy of cluster localization is verified by the simulation results. | result 0.99 | 0.95 | 0.17 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v3
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original 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 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 multi-user 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.
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
Papers whose main result relates to this one's
States the same result 1 paper
-
Simulation results show that although the BS receiver does not require the channel information of all users, by the proposed geometry-based user scheduling (GUS) algorithm the sum-rate of the system is only slightly less than the well-known greedy weight clique (GWC) scheme \cite{SUSGoldsmithGlobcom,ITC09_Userselection_GWC}. {Finally, the robustness of the proposed algorithm to cluster localization is verified by the simulation results.
Robust User Scheduling with COST 2100 Channel Model for Massive MIMO Networks · 0.98
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.