TY - GEN
T1 - Resource Allocation for OTFS with High Mobility
AU - Pu, Henglin
AU - Wang, Xuefeng
AU - Su, Lu
AU - Li, Husheng
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/105018460615
U2 - 10.1109/ICC52391.2025.11161222
DO - 10.1109/ICC52391.2025.11161222
M3 - Conference contribution
AN - SCOPUS:105018460615
T3 - IEEE International Conference on Communications
SP - 7096
EP - 7101
BT - ICC 2025 - IEEE International Conference on Communications
A2 - Valenti, Matthew
A2 - Reed, David
A2 - Torres, Melissa
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2025 IEEE International Conference on Communications, ICC 2025
Y2 - 8 June 2025 through 12 June 2025
ER -