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

Low Complexity Iterative Rake Decision Feedback Equalizer for Zero-Padded OTFS Systems

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
75
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
4
1

Relationship

4
5

Authors

Journals

citations
Cited by 186 publications
(75 citation statements)
references
References 21 publications
0
75
0
Order By: Relevance
“…For BER plots, 10 5 frames are send for every point in the BER curve. In [13], it was shown that the proposed matched filtered GS algorithm in Section III-B can be implemented in the time domain in N M (2L + 1) complex multiplications per iteration. Moreover, in OTFS employing similar detector, taking the hard estimates between every iteration requires converting the timedomain samples to the delay-Doppler domain and replacing them with the nearest QAM symbol and then converting them back to get the improved time domain estimates.…”
Section: Simulation Results and Discussionmentioning
confidence: 99%
“…For BER plots, 10 5 frames are send for every point in the BER curve. In [13], it was shown that the proposed matched filtered GS algorithm in Section III-B can be implemented in the time domain in N M (2L + 1) complex multiplications per iteration. Moreover, in OTFS employing similar detector, taking the hard estimates between every iteration requires converting the timedomain samples to the delay-Doppler domain and replacing them with the nearest QAM symbol and then converting them back to get the improved time domain estimates.…”
Section: Simulation Results and Discussionmentioning
confidence: 99%
“…where is the relaxation parameter to improve the detector convergence for higher modulation schemes like 64-QAM, [29], [35], [36]. As initial estimates to the iterative detection, we chose X (0) = 0 × or the MMSE solution presented in [26] yielding faster convergence.…”
Section: Low-complexity Detectionmentioning
confidence: 99%
“…where δ is the relaxation parameter to improve the detector convergence for higher modulation schemes like 64-QAM, [13], [20], [21]. As initial estimate to the iterative detection, we can chose either X (0) = 0 or the MMSE solution in (21) yielding faster convergence.…”
Section: B Block-wise Time Domain Iterative Detectormentioning
confidence: 99%
“…1. Relation between the different discrete information symbol domains and the corresponding modulation schemes [6]- [13].…”
Section: Introductionmentioning
confidence: 99%