Multi-User Detection for Sporadic IDMA Transmission Based on Compressed Sensing

被引:5
作者
Li, Bo [1 ]
Du, Rui [1 ]
Kang, Wenjing [1 ]
Liu, Gongliang [1 ]
机构
[1] Harbin Inst Technol Weihai, Sch Informat & Elect Engn, 2 West Wenhua Rd, Weihai 264209, Peoples R China
基金
中国国家自然科学基金;
关键词
multi-user detection; interleave division multiple access; compressed sensing; internet of things; COMMUNICATION; RECOVERY; INTERNET; SIGNALS; THINGS;
D O I
10.3390/e19070334
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The Internet of Things (IoT) is placing new demands on existing communication systems. The limited orthogonal resources do not meet the demands of massive connectivity of future IoT systems that require efficient multiple access. Interleave-division multiple access (IDMA) is a promising method of improving spectral efficiency and supporting massive connectivity for IoT networks. In a given time, not all sensors signal information to an aggregation node, but each node transmits a short frame on occasion, e.g., time-controlled or event-driven. The sporadic nature of the uplink transmission, low data rates, and massive connectivity in IoT scenarios necessitates minimal control overhead communication schemes. Therefore, sensor activity and data detection should be implemented on the receiver side. However, the current chip-by-chip (CBC) iterative multi-user detection (MUD) assumes that sensor activity is precisely known at the receiver. In this paper, we propose three schemes to solve the MUD problem in a sporadic IDMA uplink transmission system. Firstly, inspired by the observation of sensor sparsity, we incorporate compressed sensing (CS) to MUD in order to jointly perform activity and data detection. Secondly, as CS detection could provide reliable activity detection, we combine CS and CBC and propose a CS-CBC detector. In addition, a CBC-based MUD named CBC-AD is proposed to provide a comparable baseline scheme.
引用
收藏
页数:13
相关论文
共 24 条
[1]  
Baraniuk R, P 2007 IEEE RAD C BO
[2]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[3]   Compressive sensing based multi-user detection for machine-to-machine communication [J].
Bockelmann, C. ;
Schepker, H. F. ;
Dekorsy, A. .
TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2013, 24 (04) :389-400
[4]   Iterative Soft Interference Cancellation for Sparse BPSK Signals [J].
Bockelmann, Carsten .
IEEE COMMUNICATIONS LETTERS, 2015, 19 (05) :855-858
[5]   Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information [J].
Candès, EJ ;
Romberg, J ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :489-509
[6]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[7]  
Chen Y., P 2014 IEEE 79 VEH T
[8]   Precise Undersampling Theorems [J].
Donoho, David L. ;
Tanner, Jared .
PROCEEDINGS OF THE IEEE, 2010, 98 (06) :913-924
[9]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306
[10]   Block-Sparse Signals: Uncertainty Relations and Efficient Recovery [J].
Eldar, Yonina C. ;
Kuppinger, Patrick ;
Boelcskei, Helmut .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (06) :3042-3054