TY - GEN
T1 - Resource Allocation for NOMA Based OTFS Transmission with Heterogeneous Mobility Users
AU - Lin, Xialun
AU - Huang, Shao
AU - Zhao, Yaodong
AU - Tie, Zhuangzhuang
AU - Shi, Jia
AU - Liang, Wei
AU - Li, Zan
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - This paper investigates the reliability performance of the non-orthogonal multiple access (NOMA) based orthog-onal time frequency space (OTFS) system, namely NOMA-OTFS, where both high-mobility and low-mobility users coexist. To minimize the average bit error rate (BER), we formu-late the resource allocation for the downlink NOMA-OTFS transmission, where the user pairing, transmit power, and resource blocks are jointly optimized. To solve this mixed integer programming problem, we first develop the power allocation scheme in the scenario of only two users, then apply it to the general case and obtain the scheme of user pairing and resource block allocation by a proposed near-optimal NOMA users and resource blocks three-sided matching alogrithm (URMA). The simulation results demonstrate that the proposed algorithm significantly outperforms the random matching method and greedy algorithm, and its performance is very close to the optimal exhaustive method.
AB - This paper investigates the reliability performance of the non-orthogonal multiple access (NOMA) based orthog-onal time frequency space (OTFS) system, namely NOMA-OTFS, where both high-mobility and low-mobility users coexist. To minimize the average bit error rate (BER), we formu-late the resource allocation for the downlink NOMA-OTFS transmission, where the user pairing, transmit power, and resource blocks are jointly optimized. To solve this mixed integer programming problem, we first develop the power allocation scheme in the scenario of only two users, then apply it to the general case and obtain the scheme of user pairing and resource block allocation by a proposed near-optimal NOMA users and resource blocks three-sided matching alogrithm (URMA). The simulation results demonstrate that the proposed algorithm significantly outperforms the random matching method and greedy algorithm, and its performance is very close to the optimal exhaustive method.
KW - NOMA
KW - OTFS
KW - Power allocation
KW - User pairing
UR - http://www.scopus.com/inward/record.url?scp=85146915825&partnerID=8YFLogxK
U2 - 10.1109/ICICN56848.2022.10006462
DO - 10.1109/ICICN56848.2022.10006462
M3 - 会议稿件
AN - SCOPUS:85146915825
T3 - 2022 IEEE 10th International Conference on Information, Communication and Networks, ICICN 2022
SP - 91
EP - 98
BT - 2022 IEEE 10th International Conference on Information, Communication and Networks, ICICN 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 10th IEEE International Conference on Information, Communication and Networks, ICICN 2022
Y2 - 23 August 2022 through 24 August 2022
ER -