Practical Pulse-Shaping Waveforms for Reduced-Cyclic-Prefix OTFS
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
In this paper, we model M × N orthogonal time frequency space modulation (OTFS) over a P-path doubly dispersive channel with delays less than τmaxand Doppler shifts in the range (νmin,νmax). We first derive in a simple matrix form the input-output relation in the delay-Doppler domain for practical (e.g., rectangular) pulse-shaping waveforms, next generalize it to arbitrary waveforms. This relation extends the original OTFS input-output approach, which assumes ideal pulse-shaping waveforms that are bi-orthogonal in both time and frequency. We show that the OTFS input-output relation has a simple sparse structure that enables one to use low-complexity detection algorithms. Different from previous work, only a single cyclic prefix is added at the end of the OTFS frame, significantly reducing the overhead, without incurring any penalty from the loss of bi-orthogonality of the pulse-shaping waveforms. Finally, we compare the OTFS performance with different pulse-shaping waveforms, and show that the reduction of out-of-band power may introduce nonuniform channel gains for the transmitted symbols, thus impairing the overall error performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Orthogonal Time Frequency Space Modulation
Hadani, R., Rakib, S., Tsatsanis, M., Monk, A., Goldsmith, A. J., Molisch, A. F., & Calderbank, R. (2017) · 2017 IEEE Wireless Communications and Networking Conference (WCNC) · doi:10.1109/wcnc.2017.7925924 · Cited by 1,893
Prolate Spheroidal Wave Functions, Fourier Analysis, and Uncertainty-V: The Discrete Case
Slepian, D. (1978) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1978.tb02104.x · Cited by 1,741
Interference Cancellation and Iterative Detection for Orthogonal Time Frequency Space Modulation
Raviteja, P., Phan, K. T., Hong, Y., & Viterbo, E. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2860011 · Cited by 1,233
Self-citationLow Complexity Modem Structure for OFDM-Based Orthogonal Time Frequency Space Modulation
Farhang, A., RezazadehReyhani, A., Doyle, L. E., & Farhang-Boroujeny, B. (2018) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2017.2776942 · Cited by 264
Low-complexity iterative detection for orthogonal time frequency space modulation
Raviteja, P., Phan, K. T., Jin, Q., Hong, Y., & Viterbo, E. (2018) · 2018 IEEE Wireless Communications and Networking Conference (WCNC) · doi:10.1109/wcnc.2018.8377159 · Cited by 165
Self-citationAnalysis of Discrete-Time MIMO OFDM-Based Orthogonal Time Frequency Space Modulation
RezazadehReyhani, A., Farhang, A., Ji, M., Chen, R. R., & Farhang‐Boroujeny, B. (2018) · International Conference on Communications · doi:10.1109/icc.2018.8422467 · Cited by 123
Noncoherent Capacity of Underspread Fading Channels
Durisi, G., Schuster, U. G., Bölcskei, H., & Shamai, S. S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034807 · Cited by 100
Delay-Doppler Channel Estimation in Almost Linear Complexity
Fish, A., Gurevich, S., Hadani, R., Sayeed, A. M., & Schwartz, O. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2273931 · Cited by 87
Cited by
Embedded Pilot-Aided Channel Estimation for OTFS in Delay–Doppler Channels
Raviteja, P., Phan, K. T., & Hong, Y. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2906357 · Cited by 908
Self-citationEvolution of NOMA Toward Next Generation Multiple Access (NGMA) for 6G
Liu, Y., Zhang, S., Mu, X., Ding, Z., Schober, R., Al-Dhahir, N., Hossain, E., & Shen, X. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3145234 · Cited by 595
Low complexity LMMSE Receiver for OTFS
Tiwari, S., Das, S. S., & Rangamgari, V. (2019) · IEEE Communications Letters · doi:10.1109/lcomm.2019.2945564 · Cited by 271
Xu, C., Xiang, L., An, J., Dong, C., Sugiura, S., Maunder, R. G., Yang, L.-L., & Hanzo, L. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3203895 · Cited by 90
Metadata
- Authors
- Raviteja, P., Hong, Y., Viterbo, E., & Biglieri, E.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2019-01
- Volume
- 68
- Issue
- 1
- Pages
- 957-961
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W2899406779
- Cited by
- 616
- References
- 8
- FWCI
- 9.78
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.