Advanced search
Start date
Betweenand


Near-Optimal Pilot Assignment in Cell-Free Massive MIMO

Full text
Author(s):
Guedes, Raphael M. ; de Rezende, Jose F. ; Barbosa, Valmir C.
Total Authors: 3
Document type: Journal article
Source: INTERNET TECHNOLOGY LETTERS; v. N/A, p. 6-pg., 2025-01-06.
Abstract

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)

FAPESP's process: 20/05127-2 - SAMURAI: smart 5G core and multiran integration
Grantee:Aldebaro Barreto da Rocha Klautau Junior
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 18/23097-3 - SFI2: slicing future internet infrastructures
Grantee:Tereza Cristina Melo de Brito Carvalho
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 21/08211-7 - PROFISSA: Programmable Future Internet for Secure Software Architectures
Grantee:Alexandre Heideker
Support Opportunities: Scholarships in Brazil - Technical Training Program - Technical Training