The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Performance Analysis of Coded OTFS Systems Over High-Mobility Channels
Open accessAbstract
Orthogonal time frequency space (OTFS) modulation is a recently developed multi-carrier multi-slot transmission scheme for wireless communications in high-mobility environments. In this paper, the error performance of coded OTFS modulation over high-mobility channels is investigated. We start from the study of conditional pairwise-error probability (PEP) of the OTFS scheme, based on which its performance upper bound of the coded OTFS system is derived. Then, we show that the coding improvement for OTFS systems depends on the squared Euclidean distance among codeword pairs and the number of independent resolvable paths of the channel. More importantly, we show that there exists a fundamental trade-off between the coding gain and the diversity gain for OTFS systems, i.e., the diversity gain of OTFS systems improves with the number of resolvable paths, while the coding gain declines. Furthermore, based on our analysis, the impact of channel coding parameters on the performance of the coded OTFS systems is unveiled. The error performance of various coded OTFS systems over high-mobility channels is then evaluated. Simulation results demonstrate a significant performance improvement for OTFS modulation over the conventional orthogonal frequency division multiplexing (OFDM) modulation over high-mobility channels. Analytical results and the effectiveness of the proposed code design are also verified by simulations with the application of both classical and modern codes for OTFS systems.
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
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 1×
“Without loss of generality, we consider the sum-product algorithm [39], [40] for OTFS detection, where the details can be found Fig.”
MethodHorn, R. A., & Johnson, C. R. (2012) · doi:10.1017/cbo9781139020411 · Cited by 4,642
Satellite-5G Integration: A Network Perspective
Giambene, G., Kota, S., & Pillai, P. (2018) · IEEE Network · doi:10.1109/mnet.2018.1800037 · Cited by 341
Cited by
Yuan, W., Wei, Z., Li, S., Yuan, J., & Ng, D. W. K. (2021) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2021.3117404 · Cited by 383
Self-citationOff-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-citationXu, 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
- Li, S., Yuan, J., Yuan, W., Wei, Z., Bai, B., & Ng, D. W. K.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2021-09
- Volume
- 20
- Issue
- 9
- Pages
- 6033-6048
- ISSN
- 1536-1276 (ISSN-L)
- 1558-2248
- OpenAlex
- W3154139020
- Cited by
- 225
- References
- 4
- FWCI
- 10.15
- 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: Performance Analysis of Coded OTFS Systems Over High-Mobility Channels. https://app.cochat.ai/papers/10.1109/twc.2021.3071493
- The paper
- Li, S., Yuan, J., Yuan, W., Wei, Z., Bai, B., & Ng, D. W. K. (2021). Performance Analysis of Coded OTFS Systems Over High-Mobility Channels. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2021.3071493
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.