Compressive Random Access Using A Common Overloaded Control Channel
Gerhard Wunder, Peter Jung, Mohammed Ramadan

TL;DR
This paper proposes a novel 'one shot' random access method using a common overloaded control channel, enabling efficient user detection and data demodulation without prior synchronization, supported by theoretical analysis and LTE-A simulations.
Contribution
It introduces a new random access procedure that jointly detects user activity and channel profiles using compressive sensing, with explicit rate expressions and practical LTE-A simulations.
Findings
Achieves sparse random access of 100 users in 1ms
Provides explicit rate and scaling laws for the system
Validates approach with LTE-A-like simulations
Abstract
We introduce a "one shot" random access procedure where users can send a message without a priori synchronizing with the network. In this procedure a common overloaded control channel is used to jointly detect sparse user activity and sparse channel profiles. The detected information is subsequently used to demodulate the data in dedicated frequency slots. We analyze the system theoretically and provide a link between achievable rates and standard compressing sensing estimates in terms of explicit expressions and scaling laws. Finally, we support our findings with simulations in an LTE-A-like setting allowing "one shot" sparse random access of 100 users in 1ms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
