English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This letter focuses on the problem of pilot assignment in cell-free massiveMIMO systems. Exploiting the well-known Hungarian algorithms, two proceduresare proposed, one maximizing the system throughput, and the other onemaximizing the fairness across users. The algorithms operate based on theknowledge of large-scale fading coefficients as a proxy for the distancesbetween users in the system and take into account both the uplink and downlinkperformance. Numerical results show that the proposed pilot assignmentalgorithms are effective and outperform the many competing alternativesavailable in the literature.

Pilot Assignment in Cell-Free Massive MIMO based on the Hungarian Algorithm