pith. sign in

arxiv: 1404.2119 · v1 · pith:743GPFHUnew · submitted 2014-04-08 · 💻 cs.IT · math.IT

Characterization of Coded Random Access with Compressive Sensing based Multi-User Detection

classification 💻 cs.IT math.IT
keywords accessdetectionlayerrandomcodedmulti-usercompressivecs-mud
0
0 comments X p. Extension
pith:743GPFHU Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{743GPFHU}

Prints a linked pith:743GPFHU badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

The emergence of Machine-to-Machine (M2M) communication requires new Medium Access Control (MAC) schemes and physical (PHY) layer concepts to support a massive number of access requests. The concept of coded random access, introduced recently, greatly outperforms other random access methods and is inherently capable to take advantage of the capture effect from the PHY layer. Furthermore, at the PHY layer, compressive sensing based multi-user detection (CS-MUD) is a novel technique that exploits sparsity in multi-user detection to achieve a joint activity and data detection. In this paper, we combine coded random access with CS-MUD on the PHY layer and show very promising results for the resulting protocol.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.