Unsourced multiple access: A coding paradigm for massive random access

G Liva, Y Polyanskiy - Proceedings of the IEEE, 2024 - ieeexplore.ieee.org
This article is a tutorial introduction to the field of unsourced multiple access (UMAC)
protocols. We first provide a historical survey of the evolution of random access protocols …

Coded compressed sensing with list recoverable codes for the unsourced random access

K Andreev, P Rybin, A Frolov - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
We consider a coded compressed sensing approach for the unsourced random access and
replace the outer tree code proposed by Amalladinne et al.(2020) with the list recoverable …

Coded demixing for unsourced random access

JR Ebert, VK Amalladinne, S Rini… - IEEE Transactions …, 2022 - ieeexplore.ieee.org
Unsourced random access (URA) is a recently proposed multiple access paradigm tailored
to the uplink channel of machine-type communication networks. By exploiting a strong …

An enhanced decoding algorithm for coded compressed sensing with applications to unsourced random access

VK Amalladinne, JR Ebert, JF Chamberland… - Sensors, 2022 - mdpi.com
Unsourced random access (URA) has emerged as a pragmatic framework for next-
generation distributed sensor networks. Within URA, concatenated coding structures are …

Patterned Reed–Muller Sequences with Outer A-Channel Codes and Projective Decoding for Slot-Controlled Unsourced Random Access

W Xie, H Zhang - Sensors, 2023 - mdpi.com
We propose a novel slot-pattern-control based coded compressed sensing for unsourced
random access with an outer A-channel code capable of correcting t errors. Specifically, an …

Near-optimal coding for many-user multiple access channels

K Hsieh, C Rush… - IEEE Journal on Selected …, 2022 - ieeexplore.ieee.org
This paper considers the Gaussian multiple-access channel in the asymptotic regime where
the number of users grows linearly with the code length. We propose efficient coding …