Grouping pilot allocation scheme based on matching algorithm in massive MIMO system

来源 :高技术通讯(英文版) | 被引量 : 0次 | 上传用户:jocelynsusan
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
Pilot allocation is one of the effective means to reduce pilot pollution in massive multiple-input multiple-output ( MIMO) systems. The goal of this paper is to improve the uplink achievable sum rates of strong users, and ensure the quality of service ( QoS ) requirements of weak users at the same time, so that the sum rates of system can be improved. Combining with the technical advantage of pilot grouping, a low complexity pilot allocation scheme based on matching algorithm is proposed, which divides the users in the target cell into weak user group and strong user group, and adopts the minimum-maximum matching method to allocate pilots in weak user group. Through the introduction of Hungarian algorithm, a pilot allocation method is designed to ensure the fairness of the strong us-ers. The simulation results show that, compared with the smart pilot allocation scheme, the pilot al-location scheme based on Hungarian algorithm, the pilot allocation scheme based on user grouping and the random pilot allocation scheme, the system performance of the proposed scheme has been ef-fectively improved.
其他文献
Persian oak (Quercus brantii var. persica) is a dominant tree species of Zagros forests in a semi-arid area, weste Iran. However, the capacity of biomass and ca