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

Hyperparameter-Free Receiver for Grant-Free NOMA Systems With MIMO-OFDM

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
4

Relationship

3
5

Authors

Journals

citations
Cited by 14 publications
(6 citation statements)
references
References 16 publications
0
6
0
Order By: Relevance
“…As described in [25], this granting procedure results in a latency of around 9.5 millisecond (ms), which hinders meeting the strict latency requirements of some IoT use cases [26]. Hence, grant-free access techniques such as š¾-repetition [27], variants of diversity slotted ALOHA [28][29][30] and code-domain GF-NOMA [25,[31][32][33][34] have been actively investigated to meet these low-latency re-quirements. Code-domain GF-NOMA can allow more users to transmit simultaneously without the BS's granting pro-cess and can theoretically achieve the most powerefficient communications [35].…”
Section: Grant-free Noma For Low-latency Massive Accessmentioning
confidence: 99%
“…As described in [25], this granting procedure results in a latency of around 9.5 millisecond (ms), which hinders meeting the strict latency requirements of some IoT use cases [26]. Hence, grant-free access techniques such as š¾-repetition [27], variants of diversity slotted ALOHA [28][29][30] and code-domain GF-NOMA [25,[31][32][33][34] have been actively investigated to meet these low-latency re-quirements. Code-domain GF-NOMA can allow more users to transmit simultaneously without the BS's granting pro-cess and can theoretically achieve the most powerefficient communications [35].…”
Section: Grant-free Noma For Low-latency Massive Accessmentioning
confidence: 99%
“…, (12) where p X (x n ; Ī», Ī² t ) is the prior distribution of x n given by p X (xn ; Ī», Ī² t ) = (1 āˆ’ Ī»)Ī“ 0 (xn ) + Ī»CN(xn ; 0 M , Ī² t,n I M ). ( 13)…”
Section: B Em-mmv-amp Algorithmmentioning
confidence: 99%
“…Moreover, a covariance-based approach was proposed in [11], [12], which reformulates AUD into a maximum likelihood estimation problem including a sample covariance matrix and solves it using the coordinate descent (CD) method. Although this approach can achieve superior performance without prior knowledge of the channels, its computational complexity grows quadratically with the pilot sequence length, inducing a prohibitive one in massive grant-free (GF) access.…”
Section: Introductionmentioning
confidence: 99%
“…It hence is an attractive choice for 4G-LTE and 5G-NR [25]. Very recently, [26] and the early version of this work present OFDM-based grant-free access schemes for a wideband system under frequency-selective fading and propose ML estimation-based device activity detection methods for a single-cell network.…”
Section: Introductionmentioning
confidence: 99%
“…Specifically, the authors in [26] ignore the relationship among multiple paths for each device for tractability and solve the maximization of an upper bound of the log-likelihood function under a specific frequency-selective fading model. On the contrary, in [1], we precisely characterize the relationship among multiple channel taps for each device and maximize the exact log-likelihood function under frequency-selective Rayleigh fading.…”
Section: Introductionmentioning
confidence: 99%