Compressed Sensing Neyman-Pearson Based Activity Detection for Sparse Multiuser Communications

Conference: SCC 2015 - 10th International ITG Conference on Systems, Communications and Coding
02/02/2015 - 02/05/2015 at Hamburg, Germany

Proceedings: ITG-Fb 254: 10th International ITG Conference on Systems, Communications and Coding (SCC 2015)

Pages: 6Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Authors:
Monsees, Fabian; Bockelmann, Carsten; Dekorsy, Armin (Department of Communications Engineering, University of Bremen, Germany)

Abstract:
Compressed Sensing Multiuser Detection (CS-MUD) is a novel approach towards decreased signalling overhead in Massive Machine Type Communications (MMC). At its core CS-MUD employs techniques from Compressed Sensing and sparse signal processing to detect activity and data of nodes in MMC directly at the PHY. This approach inherently requires proper control of errors occurring at the activity detection as false alarm and missed detection errors. These two error events heavily impact the system performance and also impact the performance of higher layer error handling techniques. To simplify handling of activity errors, this paper introduces a new algorithm to keep one of these error rates constant over the whole SNR while minimizing the counterpart. This approach is commonly known as Neyman-Pearson detection and allows for detection at constant false alarm or constant missed detection rate. To employ Neyman- Pearson detection in CS-MUD we introduce a so called adaptive threshold Neyman-Pearson approach which is based on activity Log Likelihood ratios.