The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Low-Complexity Linear Equalization for OTFS Modulation
Abstract
In this letter, we propose low-complexity linear equalizers for orthogonal time frequency space (OTFS) modulation that exploit the structure of the effective channel matrix in OTFS. The proposed approach exploits the block circulant nature of the OTFS channel matrix to achieve significant complexity reduction. For an N × M OTFS system, where N and M are the number of Doppler and delay bins, respectively, the proposed approach gives exact minimum mean square error (MMSE) and zero-forcing (ZF) solutions with just O(MN log MN) complexity, while MMSE and ZF solutions using the traditional matrix inversion approach require O(M3N3) complexity. The proposed approach can provide low complexity initial solutions for local search techniques to achieve enhanced bit 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
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
Optimal ofdm design for time-frequency dispersive channels
Strohmer, T., & Beaver, S. (2003) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.814200 · Cited by 285
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
- Surabhi, G. D., & Chockalingam, A.
- Venue
- IEEE Communications Letters
- Published
- 2020-02
- Volume
- 24
- Issue
- 2
- Pages
- 330-334
- ISSN
- 1089-7798 (ISSN-L)
- 1558-2558
- 2373-7891
- OpenAlex
- W2990723501
- Cited by
- 268
- References
- 4
- FWCI
- 8.99
- 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
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 Linear Equalization for OTFS Modulation. https://app.cochat.ai/papers/10.1109/lcomm.2019.2956709
- The paper
- Surabhi, G. D., & Chockalingam, A. (2020). Low-Complexity Linear Equalization for OTFS Modulation. IEEE Communications Letters. https://doi.org/10.1109/lcomm.2019.2956709
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.