Pilot Assignment in Cell-Free Massive MIMO Based on the Hungarian Algorithm
Pilot Assignment in Cell-Free Massive MIMO Based on the Hungarian Algorithm
This letter focuses on the problem of pilot assignment in cell-free massive MIMO systems. Exploiting the well-known Hungarian algorithms, two procedures are proposed, one maximizing the system throughput, and the other one maximizing the fairness across users. The algorithms operate based on the knowledge of large-scale fading coefficients as a …