TY - JOUR
T1 - Map-based active user and data detection for massive machine-Type communications
AU - Jeong, Byeong Kook
AU - Shim, Byonghyo
AU - Lee, Kwang Bok
N1 - Funding Information:
Manuscript received October 19, 2017; revised March 2, 2018 and May 7, 2018; accepted June 14, 2018. Date of publication June 21, 2018; date of current version September 17, 2018. This work was supported by Institute for Information and Communications Technology Promotion funded by the Korea government (MSIP) under Grant 2016-0-00209 and in part by the NRF funded by the Korea government (MSIP) under Grant 2016R1A2B3015576. The review of this paper was coordinated by Dr. M. Marchese. This paper was presented in part at the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2018), Calgary, AB, Canada [1]. (Corresponding author: Kwang Bok Lee.) The authors are with the Department of Electrical and Computer Engineering and the Institute of New Media and Communications, Seoul National University, Seoul 151-742, South Korea (e-mail:,jeongbkmcl@snu.ac.kr; bshim@snu.ac.kr; klee@snu.ac.kr).
Publisher Copyright:
© 1967-2012 IEEE.
PY - 2018/9
Y1 - 2018/9
N2 - With the advent of the Internet of things, massive machine-Type communications (mMTC) have become one of the most important requirements for next generation communication systems. In the mMTC scenarios, grant-free nonorthogonal multiple access on the transmission side and compressive sensing-based multi-user detection (CS-MUD) on the reception side are a promising solution because many users sporadically transmit small data packets at low rates. In this paper, we propose a novel CS-MUD algorithm for the active user and data detection in the mMTC systems. The proposed scheme consists of the maximum a posteriori probability (MAP) based active user detector (MAP-AUD) and the MAP-based data detector (MAP-DD). By exchanging the extrinsic information between MAP-AUD and MAP-DD, the proposed algorithm improves the active user detection performance and the reliability of the data detection. In addition, we extend the proposed algorithm to exploit group sparsity. By jointly processing the multiple received data with common activity, the proposed algorithm dramatically enhances the active user detection performance. We show by numerical experiments that the proposed algorithm achieves a substantial per7formance gain over existing algorithms.
AB - With the advent of the Internet of things, massive machine-Type communications (mMTC) have become one of the most important requirements for next generation communication systems. In the mMTC scenarios, grant-free nonorthogonal multiple access on the transmission side and compressive sensing-based multi-user detection (CS-MUD) on the reception side are a promising solution because many users sporadically transmit small data packets at low rates. In this paper, we propose a novel CS-MUD algorithm for the active user and data detection in the mMTC systems. The proposed scheme consists of the maximum a posteriori probability (MAP) based active user detector (MAP-AUD) and the MAP-based data detector (MAP-DD). By exchanging the extrinsic information between MAP-AUD and MAP-DD, the proposed algorithm improves the active user detection performance and the reliability of the data detection. In addition, we extend the proposed algorithm to exploit group sparsity. By jointly processing the multiple received data with common activity, the proposed algorithm dramatically enhances the active user detection performance. We show by numerical experiments that the proposed algorithm achieves a substantial per7formance gain over existing algorithms.
KW - Active user detection
KW - Compressive sensing-based multi-user detection
KW - Group sparsity
KW - Massive machine-Type communications
KW - Maximum a posteriori probability7
UR - http://www.scopus.com/inward/record.url?scp=85048855541&partnerID=8YFLogxK
U2 - 10.1109/TVT.2018.2849621
DO - 10.1109/TVT.2018.2849621
M3 - Article
AN - SCOPUS:85048855541
VL - 67
SP - 8481
EP - 8494
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
SN - 0018-9545
IS - 9
M1 - 8391766
ER -