论文标题
基于匈牙利算法的无细胞大型MIMO的试点分配
Pilot Assignment in Cell-Free Massive MIMO based on the Hungarian Algorithm
论文作者
论文摘要
这封信的重点是无细胞大型MIMO系统中的试点分配问题。利用著名的匈牙利算法，提出了两个程序，一个程序最大化了系统吞吐量，另一个可以最大程度地提高用户的公平性。该算法根据大规模褪色系数的知识来运行，作为系统中用户之间距离的代理，并考虑了上行链路和下行链路性能。数值结果表明，所提出的试点分配算法是有效的，并且表现优于文献中可用的许多竞争替代方案。
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 proxy for the distances between users in the system and take into account both the uplink and downlink performance. Numerical results show that the proposed pilot assignment algorithms are effective and outperform the many competing alternatives available in the literature.
