2018
DOI: 10.48550/arxiv.1802.00929
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

On OTFS Modulation for High-Doppler Fading Channels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(8 citation statements)
references
References 12 publications
0
8
0
Order By: Relevance
“…Refs. [22]- [25] propose various types of simplified receiver structures, usually based on iterative approaches. Some discussion of a discrete signal model, modulator design, and performance analysis is given in [26], [27].…”
Section: A Related Papersmentioning
confidence: 99%
See 1 more Smart Citation
“…Refs. [22]- [25] propose various types of simplified receiver structures, usually based on iterative approaches. Some discussion of a discrete signal model, modulator design, and performance analysis is given in [26], [27].…”
Section: A Related Papersmentioning
confidence: 99%
“…2. The transmitter first maps the 2D sequence of information symbols x[k, l] residing along the points of the reciprocal lattice Λ ⊥ , see (25), in the delay-Doppler domain to a 2D sequence of complex numbers X[n, m] residing along the points of the lattice Λ, (8), in the time-frequency domain. This is done through a combination of the finite symplectic Fourier transform and windowing.…”
Section: B Otfs Modulation and Demodulationmentioning
confidence: 99%
“…It can be checked that Φ e,(l) k , B (l) , and Σ e,(l) k only correspond to the non-zero positions in the sparse vector h (ul) k . Hence, the inversion operation in (44) would be much simpler than that in (23). Fortunately, when only one element in α k is updated at each iteration, Σ e,(l) k can be sequentially derived from Σ e,(l−1) k , whose details can be found in the appendix of [34].…”
Section: F Low Complex Em-vbmentioning
confidence: 99%
“…For the VB method, the computational complexity mainly depends on the calculation of the matrix inverse Σ k in (23), where a computational complexity in the order of O(N 3 L 3 ) is required.…”
Section: G Complexity Analysismentioning
confidence: 99%
See 1 more Smart Citation