pith. sign in

Massive MIMO Unsourced Random Access

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
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.

fields

cs.IT 2

years

2026 1 2019 1

verdicts

UNVERDICTED 2

representative citing papers

A Remark on Downlink Massive Random Access

cs.IT · 2026-01-22 · unverdicted · novelty 6.0

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

cs.IT · 2019-07-22 · unverdicted · novelty 6.0

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 interference cancellation below certain spectral efficiencies.

citing papers explorer

Showing 2 of 2 citing papers.

  • A Remark on Downlink Massive Random Access cs.IT · 2026-01-22 · unverdicted · none · ref 7 · internal anchor

    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 cs.IT · 2019-07-22 · unverdicted · none · ref 4 · internal anchor

    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 interference cancellation below certain spectral efficiencies.