Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 268

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

Surabhi, G. D., Chockalingam, A. · 2020 · IEEE Communications Letters

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/lcomm.2019.2956709

Cites

4 of 4 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 268

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

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.