Unsourced Random Access with Threshold$-$Based Feedback

• Main Authors: Bashir, Murwan, Nassaji, Ehsan, Truhachev, Dmitri, Bayesteh, Alireza, Vameghestahbanati, Monirosharieh
• Format: Journal Article
• Language: English
• Published: 22.11.2022
• Subjects: Computer Science - Information Theory; Mathematics - Information Theory
• DOI: 10.48550/arxiv.2211.12358

In this paper we focus on a feedback mechanism for unsourced random access (URA) communications. We propose an algorithm to construct feedback packets broadcasted to the users by the base station (BS) as well as the feedback packet format that allows the users to estimate their channels and infer positive or negative feedback based on the presented thresholding algorithm. We demonstrate that the proposed feedback imposes a much smaller complexity burden on the users compared to the feedback that positively acknowledges all successful or negatively acknowledges all undecoded users. We also show that the proposed feedback technique can lead to a substantial reduction in the packet error rates and signal-to-noise ratios (SNR)s required to support various numbers of active users in the system.