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 …
We consider the problem of unsourced random access (U-RA), a grant-free uncoordinated form of random access, in a wireless channel with a massive MIMO base station equipped …
In this paper, we study the problem of activity detection (AD) in a massive MIMO setup, where the Base Station (BS) has M≫ 1 antennas. We consider a block fading channel …
This article considers the massive MIMO unsourced random access problem on a quasi- static Rayleigh fading channel. Given a fixed message length and a prescribed number of …
L Liu, W Yu - IEEE Transactions on Signal Processing, 2018 - ieeexplore.ieee.org
This two-part paper considers an uplink massive device communication scenario in which a large number of devices are connected to a base station (BS), but user traffic is sporadic so …
This paper considers a massive random access problem in which a large number of sporadically active devices wish to communicate with a base station (BS) equipped with …
Z Chen, F Sohrabi, W Yu - IEEE transactions on wireless …, 2019 - ieeexplore.ieee.org
This paper considers sparse device activity detection for cellular machine-type communications with non-orthogonal signatures using the approximate message passing …
A Fengler, O Musa, P Jung… - IEEE Journal on Selected …, 2022 - ieeexplore.ieee.org
We consider the unsourced random access problem on a Rayleigh block-fading AWGN channel with multiple receive antennas. Specifically, we treat the slow fading scenario …
This paper considers a grant-free random access scenario for massive machine-type communications (mMTC) in which the devices are sporadically active with small payloads …