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

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 users. The simulation results show that, compared with the smart pilot allocation scheme, the pilot allocation 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 effectively improved. Copyright © by HIGH TECHNOLOGY LETTERS PRESS.