2018
DOI: 10.1109/tvt.2018.2849621
|View full text |Cite
|
Sign up to set email alerts
|

MAP-Based Active User and Data Detection for Massive Machine-Type Communications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
60
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
2
2

Relationship

1
8

Authors

Journals

citations
Cited by 68 publications
(60 citation statements)
references
References 28 publications
0
60
0
Order By: Relevance
“…Thus, the transmit vector consisting of data symbols of both active and inactive devices can be readily modeled as a sparse vector. By capitalizing on the sparsity of this multi-user vector, the multi-user detection (MUD) problem can be formulated as a sparse signal recovery problem [8]- [12]. This type of detection scheme, called compressed sensing based multi-user detection (CS-MUD), has been a key ingredient in the grant-free uplink NOMA schemes.…”
Section: Introductionmentioning
confidence: 99%
“…Thus, the transmit vector consisting of data symbols of both active and inactive devices can be readily modeled as a sparse vector. By capitalizing on the sparsity of this multi-user vector, the multi-user detection (MUD) problem can be formulated as a sparse signal recovery problem [8]- [12]. This type of detection scheme, called compressed sensing based multi-user detection (CS-MUD), has been a key ingredient in the grant-free uplink NOMA schemes.…”
Section: Introductionmentioning
confidence: 99%
“…Hence, it makes sense to exploit the originally harmful co-channel interference to enhance the secrecy performance according to the characteristics of massive access in the cellular IoT network. Commonly, B5G cellular IoT network is suggested to adopt the grant-free random access scheme for avoiding high overhead [29][30][31]. To be specific, the IoT devices can access B5G cellular network without a grant to transmit or a prior scheduling assignment.…”
Section: Introductionmentioning
confidence: 99%
“…In this case, how to optimize JADD is a challenging issue. By exploiting the inherent sparsity of sporadic traffic in mMTC, the JADD can be formulated as a compressive sensing (CS) problem and solved by typical sparse signal recovery algorithms [5]- [10]. The prior work [4] has demonstrated that the CS-based multi-user detector can outperform the traditional linear minimum mean square error (LMMSE) detector when the level of user activity is low.…”
Section: Introductionmentioning
confidence: 99%
“…The joint-expectation maximization-approximate message passing (joint-EM-AMP) algorithm in [9] can effectively reduce the computational complexity and learn the activity parameters by EM algorithm, but the noise variance was required to be known. Similarly, the maximum a posteriori probability (MAP)-based iteration detection scheme presented in [10] also required the noise variance and user activity probability as prior knowledge.…”
Section: Introductionmentioning
confidence: 99%