2018
DOI: 10.1002/ett.3424
|View full text |Cite
|
Sign up to set email alerts
|

Maximum‐likelihood synchronization and channel estimation with multiuser detection in GFDMA

Abstract: Accurate estimation and correction of channel distortions and carrier frequency offset (CFO) are of a great importance in any multicarrier communication system. Hence, in this paper, we propose data‐aided CFO and channel estimation techniques for both multiuser uplink and downlink of the generalized frequency division multiple access (GFDMA). Our proposed solutions jointly estimate the CFO and channel responses based on the maximum‐likelihood criterion. To simplify the implementation of the proposed estimation… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
22
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(22 citation statements)
references
References 26 publications
0
22
0
Order By: Relevance
“…long enough to accommodate the wireless channel delay spread and use a root-raised cosine prototype filter with the roll-off factor of a = 0.1, in all the simulations [6]. 10 10 N CM method in [5] method in [6] method in [7], (γ = 1) proposed method, γ = L/2 proposed method, γ = L Fig. 2 Computational complexity comparison for different methods Fig.…”
Section: Complexity Analysismentioning
confidence: 99%
See 4 more Smart Citations
“…long enough to accommodate the wireless channel delay spread and use a root-raised cosine prototype filter with the roll-off factor of a = 0.1, in all the simulations [6]. 10 10 N CM method in [5] method in [6] method in [7], (γ = 1) proposed method, γ = L/2 proposed method, γ = L Fig. 2 Computational complexity comparison for different methods Fig.…”
Section: Complexity Analysismentioning
confidence: 99%
“…As shown in this figure, the MSE performance of our proposed estimator improves as signal-to-noise ratio (SNR) increases and is close to the relevant Cramer-Rao bound. We also compare our method with the ones in [5,6] where the PN and ZC training sequences are deployed. Although our proposed method leads to the same MSE performance as the solution in [6], our proposed method has a lower computational complexity than the one in [6].…”
Section: Complexity Analysismentioning
confidence: 99%
See 3 more Smart Citations