TR2017-166
Packet Separation in Random Access Channels Via Approximate Sparse Recovery
-
- "Packet Separation in Random Access Channels Via Approximate Sparse Recovery", IEEE Global Conference on Signal and Information Processing (GlobalSIP), DOI: 10.1109/GlobalSIP.2017.8309085, November 2017.BibTeX TR2017-166 PDF
- @inproceedings{Shulkind2017nov,
- author = {Shulkind, Gal and Pajovic, Milutin and Orlik, Philip V.},
- title = {Packet Separation in Random Access Channels Via Approximate Sparse Recovery},
- booktitle = {IEEE Global Conference on Signal and Information Processing (GlobalSIP)},
- year = 2017,
- month = nov,
- doi = {10.1109/GlobalSIP.2017.8309085},
- url = {https://www.merl.com/publications/TR2017-166}
- }
,
- "Packet Separation in Random Access Channels Via Approximate Sparse Recovery", IEEE Global Conference on Signal and Information Processing (GlobalSIP), DOI: 10.1109/GlobalSIP.2017.8309085, November 2017.
-
MERL Contact:
-
Research Areas:
Abstract:
In various wireless applications, a receiver picks up data packets from multiple users where the packets share a common preamble, but otherwise carry different payloads, are not in temporal sync and are frequency shifted due to Doppler effect and oscillator imperfections. We pose the problem of identifying the number of interfering packets and extracting the payloads as one of finding a sparse representation in a redundant dictionary. However, because of large size of the dictionary due to unknown packet payloads, direct application of conventional recovery methods does not lead to computationally tractable estimation schemes. To overcome this issue, we propose Orthogonal Matching Pursuit with Approximate Atoms (OMP-AA) algorithm aimed to facilitate identification of packet collisions and payload extraction. The simulation study shows that the proposed method performs well compared to an oracle estimator which has perfect knowledge of the packet parameters