Abstract:We propose a low-complexity, energy-efficient solution for cell-free unsourced random access (URA), in which multiple distributed access points are connected to a central processing unit via a fronthaul. Assuming that each user transmits a pilot sequence followed by a polar codeword whose symbols are placed to the data part of the frame according to an on-off pattern, we utilize iterative decoding, including orthogonal matching pursuit (OMP)-based pilot detection and channel estimation, symbol estimation using a linear minimum mean square error (MMSE) solution, symbol combining, single-user decoding, and successive interference cancellation (SIC). We also present finite blocklength (FBL) performance and detailed complexity analyses. Numerical results demonstrate that the FBL analysis properly characterizes system performance and that the proposed cell-free URA scheme offers superior performance compared to existing low-complexity schemes. Namely, it offers a superior performance of up to 4.5 dB and can accommodate up to 1800 active users.
Abstract:Improved spectral efficiency and inter-user interference mitigation are important aspects of IMT-2030 and the ongoing 3GPP 6G study. ETSI established the Industry Specification Group on Multiple Access Techniques (ISG MAT) as a research and pre-standardisation activity to build wider consensus on downlink MAT for 3GPP-based 6G systems. Its first report, ETSI GR MAT 001 V1.1.1, provides a standards-oriented comparison of 3GPP-specified techniques, including OMA, MU-MIMO, and MUST, with candidate techniques comprising power-domain NOMA, RSMA, and cache-aided MU-MIMO. The report identifies operating conditions in which candidate MAT can improve spectral efficiency and assesses implications for transceiver processing, network assistance information, and reference-signal requirements. Ongoing work includes realistic 5G NR link-level evaluations and the study of MAT for non-terrestrial networks, providing timely technical evidence for 3GPP 6G standardisation discussions.
Abstract: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.
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.