The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Low complexity LMMSE Receiver for OTFS
Open accessAbstract
Orthogonal time frequency space modulation is a two dimensional (2D) delay-Doppler domain waveform. It uses inverse symplectic Fourier transform (ISFFT) to spread the signal in time-frequency domain. To extract diversity gain from 2D spreaded signal, advanced receivers are required. In this work, we investigate a low complexity linear minimum mean square error receiver which exploits sparsity and quasi-banded structure of matrices involved in the demodulation process which results in a log-linear order of complexity without any performance degradation of BER.
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
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
Practical Pulse-Shaping Waveforms for Reduced-Cyclic-Prefix OTFS
Raviteja, P., Hong, Y., Viterbo, E., & Biglieri, E. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2878891 · Cited by 616
Jiang, Y., Varanasi, M. K., & Li, J. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2112070 · Cited by 419
Fast Algorithms for Signal Processing
Blahut, R. E. (2010) · doi:10.1017/cbo9780511760921 · Cited by 274
Low 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
Cited by
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
- Tiwari, S., Das, S. S., & Rangamgari, V.
- Venue
- IEEE Communications Letters
- Published
- 2019-12
- Volume
- 23
- Issue
- 12
- Pages
- 2205-2209
- ISSN
- 1089-7798 (ISSN-L)
- 1558-2558
- 2373-7891
- OpenAlex
- W2977771885
- Cited by
- 271
- References
- 6
- FWCI
- 8.72
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Low complexity LMMSE Receiver for OTFS. https://app.cochat.ai/papers/10.1109/lcomm.2019.2945564
- The paper
- Tiwari, S., Das, S. S., & Rangamgari, V. (2019). Low complexity LMMSE Receiver for OTFS. IEEE Communications Letters. https://doi.org/10.1109/lcomm.2019.2945564
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.