Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling
Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling
复制标题
通过数据重复、排列和加扰实现衰落信道上的无源随机接入
DOI:
--
复制
发表时间:
2022
影响因子:
8.3
通讯作者:
D. Truhachev
中科院分区:
文献类型:
--
作者:
Ehsan Nassaji;Murwan Bashir;D. Truhachev
We focus on an unsourced random access (URA) system for communication over fading channels where the payload of each packet is encoded for error-correction, repeated, permuted, and scrambled. Each packet is also equipped with a preamble that is used for channel estimation and detection of permutation and scrambling sequences utilized for payload encoding. We propose an algorithm to resolve multiple-access preamble transmission, based on the approximate message-passing (AMP), that is capable to support high numbers of active users and achieve low probabilities of miss-detection. We also develop a parallel interference cancellation technique for payload reception that iteratively refines the channel estimates and attempts to minimize the mean squared error (MSE) of the users’ data via selective error-correction decoding. Finally, we derive a detailed system performance analysis that closely matches the obtained numerical results. We demonstrate that the presented system can more than double the number of active users, supported by the state-of-the-art systems. Large gains in terms of the minimal required signal-to-noise ratios (SNR)s are also demonstrated for a wide range of active user numbers.