Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 9 min ago
PreprintCC BY 4.0arXiv

An Approach to Asynchronous Unsourced Random Access

  • Alireza Karami
  • Dmitry Trukhachev
Open at sourcePDFDOICite

Abstract

In this work we propose an approach to construct a fully asynchronous unsourced random access communications (URA) system. Besides the common URA features such as the absence of the user identification information in the packet and the decoding oriented to receiving the content of the messages, there is no limitation on the user transmission timing. The active users can transmit their packet any time on demand. The proposed system belongs to the class of preamble-payload URA formats. Contrary to the typical role of the preamble to serve as a temporary user identification, the preamble serves for the purpose of timing acquisition. The proposed system also employs a very small pool of preambles to resolve collisions of packets transmitted simultaneously.We provide a performance analysis and simulation results for the proposed system and demonstrate that for a wide range of signal-to-noise ratios (SNR)s the supported numbers of active users are close to the numbers of users supported by a slotted URA system counterpart.

Related

  1. Structured Masked Diffusion for Shared-Codebook Unsourced Random Access Decoding
    Taekyun Lee, Jiyoung Yun, Jeffrey G. Andrews +1
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  2. Variational Bayesian Tensor Decomposition With Discrete Mixture Prior for Unsourced Random Access
    Ala Baccar, Alexis Decurninge, Alberto Rech +3
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  3. Exact Joint MAP Decoding for Unknown Load and Message Counts in Orthogonal Unsourced Random Access
    Mohammad Kazemi, Mert Ozates
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  4. ODMA-based MIMO Massive Unsourced Random Access with Soft-Output Polar Codes
    Tianya Li, Xiaoran Zhang, Nan Hu +4
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  5. A Matroidal Framework for Random Access in Linear Codes
    Daniella Bar-Lev, Hiram H. López, Gretchen L. Matthews +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{karami2026approach,
  title = {{An Approach to Asynchronous Unsourced Random Access}},
  author = {Alireza Karami and Dmitry Trukhachev},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.00236},
  eprint = {2609.00236},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.00236},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - An Approach to Asynchronous Unsourced Random Access
AU  - Alireza Karami
AU  - Dmitry Trukhachev
PY  - 2026
DA  - 2026/09/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.00236
UR  - https://arxiv.org/abs/2609.00236
AB  - In this work we propose an approach to construct a fully asynchronous unsourced random access communications (URA) system. Besides the common URA features such as the absence of the user identification information in the packet and the decoding oriented to receiving the content of the messages, there is no limitation on the user transmission timing. The active users can transmit their packet any time on demand. The proposed system belongs to the class of preamble-payload URA formats. Contrary to the typical role of the preamble to serve as a temporary user identification, the preamble serves for the purpose of timing acquisition. The proposed system also employs a very small pool of preambles to resolve collisions of packets transmitted simultaneously.We provide a performance analysis and simulation results for the proposed system and demonstrate that for a wide range of signal-to-noise ratios (SNR)s the supported numbers of active users are close to the numbers of users supported by a slotted URA system counterpart.
ER  -