Compressive Random Access Using A Common Overloaded Control Channel

April 21, 2015 Β· Declared Dead Β· πŸ› 2015 IEEE Globecom Workshops (GC Wkshps)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Gerhard Wunder, Peter Jung, Mohammed Ramadan arXiv ID 1504.05318 Category cs.IT: Information Theory Citations 50 Venue 2015 IEEE Globecom Workshops (GC Wkshps) Last Checked 5 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted