arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.08428cs.ITmath.IT
收藏

大规模MIMO网络中基于COST 2100信道模型的鲁棒用户调度

Robust User Scheduling with COST 2100 Channel Model for Massive MIMO Networks

Manijeh Bashar, Alister G. Burr, Katsuyuki Haneda Kanapathippillai Cumanan

摘要:

本文考虑大规模多输入多输出(MIMO)网络,其中具有大量天线的基站(BS)与较少数量的用户进行通信。信号使用频分双工(FDD)模式传输。研究了大规模MIMO系统上行链路中的用户调度问题。我们考虑的成本2100通道模型。在本文中,我们首先提出了一种新的用户选择算法的基础上的知识的几何服务区和集群的位置,而没有完整的信道状态信息(CSI)在BS。然后,我们表明,在基于几何的随机信道模型(GSCMs)的相关性产生的共同集群在该地区。此外,利用封闭形式的Cramer-Rao下界(CRLB)的,所提出的方案的鲁棒性聚类位置误差的分析。通过对容量上界的分析表明,容量与集群在GSCM中的位置和用户在系统中的位置密切相关。仿真结果表明,虽然基站接收端不需要所有用户的信道信息,但基于几何的用户调度(GUS)算法的系统总速率仅略低于著名的贪婪权团(GWC)方案\cite{SUSGoldsmithGlobcom,ITC09_Userselection_GWC}。最后,通过仿真实验验证了该算法对簇定位的鲁棒性。

英文摘要:

This paper considers a Massive multiple-input multiple-output (MIMO) network, where the base station (BS) with a large number of antennas communicates with a smaller number of users. The signals are transmitted using frequency division duplex (FDD) mode. The problem of user scheduling with reduced overhead of channel estimation in the uplink of Massive MIMO systems has been investigated. We consider the COST 2100 channel model. In this paper, we first propose a new user selection algorithm based on knowledge of the geometry of the service area and of location of clusters, without having full channel state information (CSI) at the BS. We 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 (CRLB)s, 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 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑