Fully Asynchronous Unsourced Random Access over Fading Channels

We examine unsourced random access in a fully asynchronous setup, where active users transmit their data without restriction on the start time over a fading channel. In the proposed scheme, the transmitted signal consists of a pilot sequence and a polar codeword, with the polar codeword distributed across the data part of the packet in an on-off pattern. The receiver uses a double sliding-window decoder, where the inner window employs iterative decoding with joint timing and pilot detection, channel estimation, single-user decoding, and successive interference cancellation to recover the message bits, while the outer window enhances interference cancellation. The numerical results indicate that the proposed scheme exhibits only a slight performance loss compared to the synchronous benchmark while being more applicable in practice.

A Fully Asynchronous Unsourced Random Access Scheme

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.