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

Joint Channel Estimation and Multiuser Detection for Uplink Grant-Free NOMA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
76
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 94 publications
(79 citation statements)
references
References 7 publications
1
76
0
Order By: Relevance
“…Further gains are possible, e.g., by using more advanced joint multi-user detection algorithms and multiple receive antennas to separate the superimposed signals. Note that user activity detection and channel estimation are required before the data detection, but this may also be done jointly [13]. For block-fading channels, there is further a tradeoff between the diversity achieved by using multiple slots and the required channel estimation overhead [14].…”
Section: B Grant-free Noma With Advanced Receiversmentioning
confidence: 99%
“…Further gains are possible, e.g., by using more advanced joint multi-user detection algorithms and multiple receive antennas to separate the superimposed signals. Note that user activity detection and channel estimation are required before the data detection, but this may also be done jointly [13]. For block-fading channels, there is further a tradeoff between the diversity achieved by using multiple slots and the required channel estimation overhead [14].…”
Section: B Grant-free Noma With Advanced Receiversmentioning
confidence: 99%
“…In our analysis, we measure the complexity in terms of the number of floating point operations (flops). Initially, in the FC layer, the input vectorŷ ∈ R 2m×1 is multiplied by the initial weight W in ∈ R α×2m and the bias b in ∈ R α×1 is added (see (9)). The complexity of the initial FC layer C in is…”
Section: Comments On Complexitymentioning
confidence: 99%
“…Numerical results demonstrate that the proposed AUD scheme outperforms the conventional approaches in both AUD success probability and computational complexity.By exploiting the fact that only a few active devices in a cell transmit the information concurrently (see Fig. 1), the AUD problem can be readily formulated as a sparse recovery problem [8], [9]. Since the transmit vector is sparse, compressed sensing (CS) technique has been popularly employed [10], [11].…”
mentioning
confidence: 99%
“…Fig. 1 shows the example of the standard Throughout the paper, we make the following assumptions [34], [36].…”
Section: A Grant-free Noma Transmissionmentioning
confidence: 99%
“…In Fig. 5, we compare the AER and SER performance of our proposed algorithms with the state-of-the-art BSASP algorithm in [36]. For comparison, we also include the performance of the two-phase detection scheme [30] in which the receiver first estimates the user activities and channel coefficients jointly, and then recovers the signals sent by the active users, both through AMP algorithms.…”
Section: A Error Rate Performancementioning
confidence: 99%