English

A Fully Asynchronous Unsourced Random Access Scheme

Signal Processing 2025-04-16 v1

Abstract

We investigate fully asynchronous unsourced random access (URA), and propose a high-performing scheme that employs on-off division multiple access (ODMA). In this scheme, active users distribute their data over the transmit block based on a sparse transmission pattern without any limitations on the starting time. At the receiver side, we adopt a double sliding-window decoding approach, utilizing a smaller inner decoding window of two block lengths within a larger outer window to enhance the interference cancellation process. Within the inner window, the receiver iteratively applies preamble-free joint starting time and pattern detection, single-user decoding, and successive interference cancellation operations. A notable feature of the proposed scheme is its elimination of the need for a preamble for starting time detection; this is achieved using ODMA transmission patterns. Numerical results demonstrate that the proposed asynchronous URA scheme outperforms existing alternatives.

Keywords

Cite

@article{arxiv.2504.11131,
  title  = {A Fully Asynchronous Unsourced Random Access Scheme},
  author = {Mert Ozates and Mohammad Kazemi and Gianluigi Liva and Deniz Gündüz},
  journal= {arXiv preprint arXiv:2504.11131},
  year   = {2025}
}
R2 v1 2026-06-28T22:59:01.964Z