SPARCs for Unsourced Random Access

DOI10.1109/TIT.2021.3081189MaRDI QIDQ5032545zbMATH OpenOpenAlexFDO

Authors Alexander Fengler, Peter Jung, Giuseppe Caire

Publication date 17 February 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1901.06234

zbMATH Keywords

AWGN channelcoding construction for unsourced random-accesssparse regression code (SPARC)

Mathematics Subject Classification ID

Communication theory (94A05)

Abstract: Unsourced random-access (U-RA) is a type of grant-free random access with a virtually unlimited number of users, of which only a certain number $K_a$ are active on the same time slot. Users employ exactly the same codebook, and the task of the receiver is to decode the list of transmitted messages. We present a concatenated coding construction for U-RA on the AWGN channel, in which a sparse regression code (SPARC) is used as an inner code to create an effective outer OR-channel. Then an outer code is used to resolve the multiple-access interference in the OR-MAC. We propose a modified version of the approximate message passing (AMP) algorithm as an inner decoder and give a precise asymptotic analysis of the error probabilities of the AMP decoder and of a hypothetical optimal inner MAP decoder. This analysis shows that the concatenated construction can achieve a vanishing per-user error probability in the limit of large blocklength and a large number of active users at sum-rates up to the symmetric Shannon capacity, i.e. as long as $K_{a}R<0.5lo{g}_2(1+K_{a}SNR)$. This extends previous point-to-point optimality results about SPARCs to the unsourced multiuser scenario. Furthermore, we give an optimization algorithm to find the power allocation for the inner SPARC code that minimizes the required $SNR$.

Cited in

(1)

• Unsourced random access

This page was built for publication: SPARCs for Unsourced Random Access

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5032545)