Low-complexity user scheduling with switched tilting for 3D cellular systems (Q1666197)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Low-complexity user scheduling with switched tilting for 3D cellular systems |
scientific article; zbMATH DE number 6926859
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Low-complexity user scheduling with switched tilting for 3D cellular systems |
scientific article; zbMATH DE number 6926859 |
Statements
Low-complexity user scheduling with switched tilting for 3D cellular systems (English)
0 references
27 August 2018
0 references
Summary: We propose a low-complexity user scheduling scheme to enhance the sum rate performance for a multicell downlink system, in which the base station (BS) is equipped with a large-scale active antenna array. First, we divide each cell into \(N\) regions according to the vertical beamwidth of the BS antennas. Next, candidate user equipment (UE) items are assigned to corresponding groups to their locations. Each scheduling slot is also divided into \(N\) equal-time subslots. Then, at each subslot, we focus on one UE group, select the optimal number, \(K^*\), of UEs for simultaneous data transmission in the manner of round-robin scheduling, and adjust the BS antenna tilting to the optimal angle \(\theta_{\text{t} \text{i} \text{l} \text{t}}^*\). In particular, \(K^*\) and \(\theta_{\text{t} \text{i} \text{l} \text{t}}^*\) for each UE group are both obtained by means of large-system asymptotic analysis. Benefiting from the random matrix theory tools, the asymptotic analytical results are independent of instantaneous channel state information of UE, which make it possible to solve \(K^*\) and \(\theta_{\text{t} \text{i} \text{l} \text{t}}^*\) offline, therefore saving the online computational resources significantly. Numerical results verify that the proposed scheme achieves good sum rate performance with extremely low computational complexity.
0 references