Near-Optimal Pilot Assignment in Cell-Free Massive MIMO

Autor(es)

Guedes, Raphael M. ; de Rezende, Jose F. ; Barbosa, Valmir C.

• Tipo de documento: Artigo Científico
• Fonte: INTERNET TECHNOLOGY LETTERS; v. N/A, p. 6-pg., 2025-01-06.

Resumo

Cell-free massive MIMO systems are currently being considered as potential enablers of future (6G) technologies for wireless communications. By combining distributed processing and massive MIMO, they are expected to deliver improved user coverage and efficiency. A possible source of performance degradation in such systems is pilot contamination, which contributes to causing interference during uplink training and affects channel estimation negatively. Contamination occurs when the same pilot sequence is assigned to more than one user. This is in general inevitable, as the number of mutually orthogonal pilot sequences corresponds to only a fraction of the coherence interval. We introduce a new algorithm for pilot assignment and analyze its performance both from a theoretical perspective and in computational experiments. We show that it has an approximation ratio close to 1 for a plausibly large number of orthogonal pilot sequences, as well as low computational complexity under massive parallelism. We also show that, on average, it outperforms other methods in terms of per-user SINR and throughput on the uplink. (AU)

• Processo FAPESP: 20/05127-2 - SAMURAI: núcleo 5G inteligente e integração de múltiplas redes de acesso
• Beneficiário: Aldebaro Barreto da Rocha Klautau Junior
• Modalidade de apoio: Auxílio à Pesquisa - Temático
• Processo FAPESP: 18/23097-3 - SFI2: fatiamento de infraestruturas de internet do futuro
• Beneficiário: Tereza Cristina Melo de Brito Carvalho
• Modalidade de apoio: Auxílio à Pesquisa - Temático
• Processo FAPESP: 21/08211-7 - PROFISSA: Programmable Future Internet for Secure Software Architectures
• Beneficiário: Alexandre Heideker
• Modalidade de apoio: Bolsas no Brasil - Programa Capacitação - Treinamento Técnico