A fully asynchronous unsourced random access scheme
File(s)
Author(s)
Ozates, Mert
Kazemi, Mohammad
Liva, Gianluigi
Gündüz, Deniz
Type
Conference Paper
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.
Date Issued
2025-09-04
Date Acceptance
2025-07-01
Citation
2025 IEEE 26th International Workshop on Signal Processing and Artificial Intelligence for Wireless Communications (SPAWC), 2025, pp.1-5
ISSN
2325-3789
Publisher
IEEE
Start Page
1
End Page
5
Journal / Book Title
2025 IEEE 26th International Workshop on Signal Processing and Artificial Intelligence for Wireless Communications (SPAWC)
Copyright Statement
Copyright © 2025, IEEE. This is the author’s accepted manuscript made available under a CC-BY licence in accordance with Imperial’s Research Publications Open Access policy (www.imperial.ac.uk/oa-policy)
License URL
Source
2025 IEEE 26th International Workshop on Signal Processing and Artificial Intelligence for Wireless Communications (SPAWC)
Publication Status
Published
Start Date
2025-07-07
Finish Date
2025-07-10
Coverage Spatial
Surrey, United Kingdom