Massive MIMO Unsourced Random Access
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
A Remark on Downlink Massive Random Access
Deterministic variable-length codes for downlink massive random access achieve an overhead of at most 1 + log₂e bits via covering array constructions from combinatorics.
-
Energy efficient coded random access for the wireless uplink
Provides achievability bounds for random access over Rayleigh fading and shows that a practical sparse-graph code with alternating BP decoder performs close to the bounds, with a phase transition enabling perfect inte...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.