Massive MIMO Unsourced Random Access

Abstract

We consider an extension of the massive unsourced random access originally proposed by Polyanskiy to the case where the receiver has a very large number of antennas (a massive MIMO base station) and no channel state information is given to the receiver (fully non-coherent detection). Our coding approach borrows the concatenated coding idea from Amalladinne et. al., combined with a novel non-Bayesian `activity detection' algorithm for massive MIMO random access channels, that outperforms currently proposed Bayesian vector AMP (VAMP) schemes currently proposed for activity detection, and does not suffer from the numerical instabilities and requirement for accurate a priori statistics as VAMP. We show that the required transmit $E_b/N_0$ for reliable communication can be made arbitrarily small as the number of receiver antennas M grows sufficiently large.

References in corpus (1)

• Belief propagation for joint sparse recovery

Cited by in corpus (9)

• A Dimension Reduction-Based Joint Activity Detection and Channel Estimation Algorithm for Massive Access
• Joint Activity Detection and Channel Estimation in Cell-Free Massive MIMO Networks with Massive Connectivity
• Structured Massive Access for Scalable Cell-Free Massive MIMO Systems
• On the Restricted Isometry Property of Centered Self Khatri-Rao Products
• Covariance-Based Cooperative Activity Detection for Massive Grant-Free Random Access
• An Exploration of the Heterogeneous Unsourced MAC
• Cooperative Activity Detection: Sourced and Unsourced Massive Random Access Paradigms
• A Bayesian Tensor Approach to Enable RIS for 6G Massive Unsourced Random Access
• ML and MAP Device Activity Detections for Grant-Free Massive Access in Multi-Cell Networks