Details

Autor(en) / Beteiligte

• Fengler, Alexander
• Jung, Peter
• Caire, Giuseppe

Titel

SPARCs for Unsourced Random Access

Ist Teil von

• IEEE transactions on information theory, 2021-10, Vol.67 (10), p.6894-6915

Ort / Verlag

New York: IEEE

Erscheinungsjahr

2021

Quelle

IEL

Beschreibungen/Notizen

• 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 <inline-formula> <tex-math notation="LaTeX">K_{a} </tex-math></inline-formula> 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 under optimal decoding 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 <inline-formula> <tex-math notation="LaTeX">K_{a}R < 0.5\log _{2}(1+K_{a} { \mathsf {SNR}}) </tex-math></inline-formula>. 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 <inline-formula> <tex-math notation="LaTeX">{\mathsf {SNR}} </tex-math></inline-formula> required to achieve a given target per-user error probability with the AMP decoder.