Sparse Multi-User Detection for CDMA transmission using greedy algorithms

• Published in: 2011 8th International Symposium on Wireless Communication Systems pp. 291 - 295
• Main Authors: Schepker, H. F., Dekorsy, A.
• Format: Conference Proceeding
• Language: English; Japanese
• Published: IEEE 01-11-2011
• Subjects: Detectors; Estimation; Greedy algorithms; Matching pursuit algorithms; Multiaccess communication; Multiuser detection; Vectors
• ISBN: 1612844030; 9781612844039
• ISSN: 2154-0217; 2154-0225
• DOI: 10.1109/ISWCS.2011.6125356

A possible future application in communications is the wireless uplink transmission in sensor networks. This application is mainly characterized by sporadic transmission over a random access channel. Since each sensor has a low activity probability, the signal for Multi-User Detection (MUD) is sparse. Compressive Sensing (CS) theory introduces detectors that are able to recover sparse signals reliably. When applied to MUD, CS detectors perform a joint detection of both data and user activity. This allows for less control signaling, since information about the activity state of each user no longer need to be signaled. Additionally, CS detectors are able to reliably detect sparse signals even in under-determined systems. In the context of transmission with Code Division Multiple Access (CDMA) this property can be exploited by reducing the length of spreading sequences, which increases the symbol-rate for a given bandwidth, and making the CDMA system overloaded. In this paper we introduce the application of greedy CS detection algorithms to detect CDMA spread multi-user data.