🤖 AI Summary
To address the challenges of sporadic user activity and massive scale in 6G massive machine-type communications (mMTC), this paper systematically investigates unsourced random access (URA). We propose the first unified classification framework for URA schemes, encompassing Gaussian multiple-access, single-antenna fading, and MIMO fading channel models. Integrating information-theoretic bounds with practical feasibility analysis, we focus on three core issues: interference suppression, low-complexity decoding, and asynchrony robustness. Leveraging message passing, sparse coding, iterative soft detection, and MIMO signal processing, we conduct end-to-end simulations and joint complexity–performance evaluation. Based on quantitative comparisons across over 100 state-of-the-art works—assessing packet error rate, computational overhead, and spectral efficiency—we introduce a scalable architecture and a practical evolution roadmap, providing systematic support for standardization and prototype validation.
📝 Abstract
Multiple access communication systems enable numerous users to share common communication resources simultaneously, playing a crucial role in wireless networks. With the emergence of the sixth generation (6G) and beyond communication systems, supporting massive machine-type communications with sporadic activity patterns is expected to become a critical challenge. Unsourced random access (URA) has emerged as a promising paradigm to address this challenge by decoupling user identification from data transmission through the use of a common codebook. This survey provides a comprehensive overview of URA solutions, covering both theoretical foundations and practical implementations. We present a systematic classification of URA solutions across three main channel models: Gaussian multiple access channels (GMACs), single-antenna fading, and multiple-input multiple-output (MIMO) fading channels. For each category, we analyze and compare state-of-the-art solutions in terms of performance, complexity, and practical feasibility. Additionally, we discuss critical challenges such as interference management, computational complexity, and synchronization issues. The survey concludes with promising future research directions and potential methods to address existing limitations, providing a roadmap for researchers and practitioners in this rapidly evolving field.