English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper considers the massive random access problem in MIMO quasi-staticRayleigh fading channels. Specifically, we derive achievability and conversebounds on the minimum energy-per-bit required for each active user to transmit$J$ bits with blocklength $n$ and power $P$ under a per-user probability oferror (PUPE) constraint, in the cases with and without \emph{a priori} channelstate information at the receiver (CSIR and no-CSI). In the case of no-CSI, weconsider both the settings with and without knowing the number $K_a$ of activeusers. The achievability bounds rely on the design of the ``good region''.Numerical evaluation shows the gap between achievability and converse bounds isless than $2.5$ dB in the CSIR case and less than $4$ dB in the no-CSI case inmost considered regimes. When the distribution of $K_a$ is known, theperformance gap between the cases with and without knowing the value of $K_a$is small. For example, in the setup with blocklength $n=1000$, payload $J=100$,error requirement $\epsilon=0.001$, and $L=128$ receive antennas, compared tothe case with known $K_a$, the extra required energy-per-bit when $K_a$ isunknown and distributed as $K_a\sim\text{Binom}(K,0.4)$ is less than $0.3$ dBon the converse side and $1.1$ dB on the achievability side. The spectralefficiency grows approximately linearly with $L$ in the CSIR case, whereas thegrowth rate decreases with no-CSI. Moreover, we study the performance of apilot-assisted scheme, which is suboptimal especially when $K_a$ is large.Building on non-asymptotic results, when all users are active and$J=\Theta(1)$, we obtain scaling laws as follows: when $L=\Theta\left(n^2\right)$ and $P=\Theta\left(\frac{1}{n^2}\right)$, one can reliablyserve $K=\mathcal{O}(n^2)$ users with no-CSI; under mild conditions with CSIR,the PUPE requirement is satisfied if and only if $\frac{nL\lnKP}{K}=\Omega\left(1\right)$.

Energy Efficiency of Massive Random Access in MIMO Quasi-Static Rayleigh Fading Channels with Finite Blocklength