A Survey on Reconfigurable Intelligent Surface-Assisted Orthogonal Time Frequency Space Systems
Bibliographic record
Abstract
The vision for 6th-generation (6G) wireless communication systems emphasizes the need for robust and reliable communication in extremely high-mobility scenarios, while also addressing critical demands for energy and spectral efficiency. Under such scenarios, doubly time-frequency selective fading channels often significantly degrade the performance of orthogonal frequency-division multiplexing (OFDM) based systems due to the impact of large delay and Doppler shifts. Recently, orthogonal time frequency space (OTFS) modulation has emerged as a promising alternative. By processing signals in the delay-Doppler (DD) domain, OTFS offers several advantages, including quasi-static channel characteristics, full-time-frequency diversity, and low peak-to-average power ratio (PAPR), making it a promising candidate for high-mobility communications. Reconfigurable intelligent surfaces (RIS) are being further integrated to enhance the performance of OTFS systems cost-effectively. With their ability to dynamically reconfigure the wireless environment, the integration of RIS can offer significant performance improvements for OTFS systems. This survey offers a comprehensive review of RIS-assisted OTFS systems, including the fundamental principles, recent advances, and future research directions. Specifically, we first introduce the background of RIS-assisted OTFS systems, outlining the opportunities and challenges of their integration. To ensure the survey is self-contained, we provide a brief overview of the fundamental principles of OTFS and RIS technologies. Building on these foundations, we present a general input-output relationship and capacity characterization for RIS-assited MIMO-OTFS systems. Then, this survey further explores cutting-edge research in areas such as input-output analysis, RIS phase shift design, channel estimation, detection techniques, RIS-assisted integrated sensing and communication (ISAC), and other novel technologies. Finally, we outline some future research directions.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.003 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".