The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Cross Domain Iterative Detection for Orthogonal Time Frequency Space Modulation
Open accessAbstract
Recently proposed orthogonal time frequency space (OTFS) modulation has been considered as a promising candidate for accommodating various emerging communication and sensing applications in high-mobility environments. In this paper, we propose a novel cross domain iterative detection algorithm to enhance the error performance of OTFS modulation. Different from conventional OTFS detection methods, the proposed algorithm applies basic estimation/detection approaches to both the time domain and delay-Doppler (DD) domain and iteratively updates the extrinsic information from two domains with the unitary transformation. In doing so, the proposed algorithm exploits the time domain channel sparsity and the DD domain symbol constellation constraints. We evaluate the estimation/detection error variance in each domain for each iteration and derive the state evolution to investigate the detection error performance. We show that the performance gain due to iterations comes from the non-Gaussian constellation constraint in the DD domain. More importantly, we prove that the proposed algorithm can indeed converge and, in the convergence, the proposed algorithm can achieve almost the same error performance as the maximum-likelihood sequence detection even in the presence of fractional Doppler shifts. Furthermore, the computational complexity associated with the domain transformation is low, thanks to the structure of the discrete Fourier transform (DFT) kernel. Simulation results are consistent with our analysis and demonstrate a significant performance improvement compared to conventional OTFS detection methods.
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
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
Cited by
Off-Grid Channel Estimation With Sparse Bayesian Learning for OTFS Systems
Wei, Z., Yuan, W., Li, S., Yuan, J., & Ng, D. W. K. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3158616 · Cited by 277
Self-citation
Metadata
- Authors
- Li, S., Yuan, W., Wei, Z., & Yuan, J.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2022-04
- Volume
- 21
- Issue
- 4
- Pages
- 2227-2242
- ISSN
- 1536-1276 (ISSN-L)
- 1558-2248
- OpenAlex
- W3200797369
- Cited by
- 184
- References
- 1
- FWCI
- 7.78
- 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
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.