vix.ing · top · new · best · stats · spec

A Fully Asynchronous Unsourced Random Access Scheme

2025/04/15 by Mert Özateş, Mohammad Kazemi, Ozates, Mert +5 · 2 citations
Computer Science · Engineering · #Advanced Wireless Communication Technologies #FOS: Electrical engineering #IoT Networks and Protocols #Signal Processing (eess.SP) #Wireless Networks and Protocols #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.2504.11131

openalex publication_date 2025/04/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

Related