Papers
Topics
Authors
Recent
Search
2000 character limit reached

Unsourced Random Access with Threshold$-$Based Feedback

Published 22 Nov 2022 in cs.IT, eess.SP, and math.IT | (2211.12358v1)

Abstract: 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.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.