Resource Allocation for OTFS with High Mobility

Orthogonal Time Frequency Space (OTFS) modulation has emerged as a promising waveform for next-generation wireless communications. OTFS demonstrates robust non-fading properties even under doubly-dispersive conditions, making it a preferred modulation scheme in complex scenarios involving high mobility. Despite its advantages, developing a low-complexity multiaccess OTFS protocol for environments with a large number of user terminals (UTs) and high mobility remains challenging due to severe multiuser interference (MUI) and rapidly changing channel states. In this paper, we propose a low-complexity algorithm to find a suboptimal solution for the joint resource block and power allocation problem in multiple access OTFS systems. Specifically, we decompose the resource block allocation and power allocation into two sub-problems. First, we perform the resource block allocation algorithm by considering the channel conditions. Then, we employ a two-stage water-filling algorithm to achieve a suboptimal power allocation. Numerical results indicate that our proposed resource allocation scheme achieves higher sum-rate than existing schemes in both 8-user and 16-user systems while reducing the complexity from exponential to linear in terms of the number of users. This makes our approach practical even in high mobility and larger user scenarios.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11161222
Primary Topic
PAPR reduction in OFDM
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Resource Allocation for OTFS with High Mobility

Xuefeng Wang, Husheng Li, Henglin Pu, Lu Su
PAPR reduction in OFDM
article

Resource Allocation for OTFS with High Mobility

Xuefeng Wang, Husheng Li, Henglin Pu, Lu Su
article en

Abstract

Orthogonal Time Frequency Space (OTFS) modulation has emerged as a promising waveform for next-generation wireless communications. OTFS demonstrates robust non-fading properties even under doubly-dispersive conditions, making it a preferred modulation scheme in complex scenarios involving high mobility. Despite its advantages, developing a low-complexity multiaccess OTFS protocol for environments with a large number of user terminals (UTs) and high mobility remains challenging due to severe multiuser interference (MUI) and rapidly changing channel states. In this paper, we propose a low-complexity algorithm to find a suboptimal solution for the joint resource block and power allocation problem in multiple access OTFS systems. Specifically, we decompose the resource block allocation and power allocation into two sub-problems. First, we perform the resource block allocation algorithm by considering the channel conditions. Then, we employ a two-stage water-filling algorithm to achieve a suboptimal power allocation. Numerical results indicate that our proposed resource allocation scheme achieves higher sum-rate than existing schemes in both 8-user and 16-user systems while reducing the complexity from exponential to linear in terms of the number of users. This makes our approach practical even in high mobility and larger user scenarios.

Vaughn College of Aeronautics and Technology (US), American Institute of Aeronautics and Astronautics (US), Nanjing University of Aeronautics and Astronautics (CN)
Openalex Percentile: Top 74%
PAPR reduction in OFDM
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.