Pilot Assignment in Cell-Free Massive MIMO based on the Hungarian Algorithm
share
This letter focuses on the problem of pilot assignment in cell-free massive MIMO systems. Exploiting the well-known Hungarian algorithms, several algorithms are proposed, either maximizing the system throughput or maximizing the system fairness. The algorithms operate based on the knowledge of large scale fading coefficients and of the positions of the mobile stations. However, the latter information is not really necessary, since the paper shows that large scale fading coefficients can be used as a proxy for the distances between the mobile users and the access points with a very limited performance loss. Numerical results will show that the proposed pilot assignment algorithms outperform several competing alternatives available in the literature.
READ FULL TEXT