Random Access in Massive MIMO by Exploiting Timing Offsets and Excess Antennas

Sanguinetti Luca (1) , Antonio d'Amico (1) , Michele Morelli (1) , Merouane Debbah (2, 3, 4)

1 University of Pisa - Università di Pisa
2 LANEAS - Large Networks and Systems Group
3 L2S - Laboratoire des signaux et systèmes
4 Mathematical and Algorithmic Sciences Lab [Paris]

Massive MIMO systems, where base stations are equipped with hundreds of antennas, are an attractive way to handle the rapid growth of data traffic. As the number of user equipments (UEs) increases, the initial access and handover in contemporary networks will be flooded by user collisions. In this paper, a random access protocol is proposed that resolves collisions and performs timing estimation by simply utilizing the large number of antennas envisioned in Massive MIMO networks. UEs entering the network perform spreading in both time and frequency domains, and their timing offsets are estimated at the base station in closed-form using a subspace decomposition approach. This information is used to compute channel estimates that are subsequently employed by the base station to communicate with the detected UEs. The favorable propagation conditions of Massive MIMO suppress interference among UEs whereas the inherent timing misalignments improve the detection capabilities of the protocol. Numerical results are used to validate the performance of the proposed procedure in cellular networks under uncorrelated and correlated fading channels. With 2.5 × 10 3 UEs that may simultaneously become active with probability 1% and a total of 16 frequency-time codes (in a given random access block), it turns out that, with 100 antennas, the proposed procedure successfully detects a given UE with probability 75% while providing reliable timing estimates.

Domaines: Sciences de l'ingénieur [physics]

Sanguinetti Luca, Antonio d'Amico, Michele Morelli, Merouane Debbah. Random Access in Massive MIMO by Exploiting Timing Offsets and Excess Antennas. IEEE Transactions on Communications, 2018, 66 (12), pp.6081-6095. ⟨10.1109/TCOMM.2018.2858793⟩. ⟨hal-02873879⟩