Papers
Topics
Authors
Recent
Search
2000 character limit reached

Unsourced Random Access With Tensor-Based and Coherent Modulations

Published 24 Apr 2023 in eess.SP, cs.IT, and math.IT | (2304.12058v1)

Abstract: Unsourced random access (URA) is a particular form of grant-free uncoordinated random access wherein the users' identities are not associated to specific waveforms at the physical layer. Tensor-based modulation (TBM) has been recently advocated as a promising technique for URA due to its ability to support a large number of active users transmitting simultaneously by exploiting tensor decomposition for user separation. We propose a novel URA scheme that builds upon TBM by splitting the transmit message into two sub-messages. This first part is modulated according to a TBM scheme, while the second is encoded using a coherent non-orthogonal multiple access (NOMA) modulation. At the receiver side, we exploit the advantages of forward error correction (FEC) coding and interference cancellation techniques. We compare the performances of the introduced scheme with state-of-the-art URA schemes under a quasi-static Rayleigh fading model, proving the energy efficiency and the fading robustness of the proposed solution.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.