TY - GEN
T1 - Secure OTFS Transmission via Joint Delay-Doppler Precoding and Time-Domain Noise Injection
AU - Liu, Qianhui
AU - Xu, Qian
AU - Li, Cong
AU - Wei, Zhiqiang
AU - Yang, Xin
AU - Wang, Ling
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - This paper studied the secure transmission problem for a single-antenna orthogonal time frequency space (OTFS) system where a transmitter sends private information to legitimate receiver with the existence of a potential eavesdropper. Without multiple antennas, we propose a joint delay-Doppler (DD) domain and time domain secure transmission strategy, instead of the traditional ones based on multi-antenna precoding. The DD-domain precoding matrix and time-domain artificial noise (AN) vector are jointly optimized to maximize the system secrecy rate. The cases where eavesdropper's channel state information (CSI) is available and unavailable are both investigated. Moreover, a low-complexity projected gradient (PG)-based algorithm is developed. Numerical results show that the benefit of time-domain AN in terms of secrecy rate becomes more significant as the total available transmit power increases. In addition, the low-complexity PG algorithm can significantly reduce computational complexity with only negligible secrecy rate loss.
AB - This paper studied the secure transmission problem for a single-antenna orthogonal time frequency space (OTFS) system where a transmitter sends private information to legitimate receiver with the existence of a potential eavesdropper. Without multiple antennas, we propose a joint delay-Doppler (DD) domain and time domain secure transmission strategy, instead of the traditional ones based on multi-antenna precoding. The DD-domain precoding matrix and time-domain artificial noise (AN) vector are jointly optimized to maximize the system secrecy rate. The cases where eavesdropper's channel state information (CSI) is available and unavailable are both investigated. Moreover, a low-complexity projected gradient (PG)-based algorithm is developed. Numerical results show that the benefit of time-domain AN in terms of secrecy rate becomes more significant as the total available transmit power increases. In addition, the low-complexity PG algorithm can significantly reduce computational complexity with only negligible secrecy rate loss.
KW - Orthogonal time frequency space
KW - precoding
KW - secrecy rate
KW - time-domain artificial noise
UR - http://www.scopus.com/inward/record.url?scp=85207648921&partnerID=8YFLogxK
U2 - 10.1109/ICCCWorkshops62562.2024.10693839
DO - 10.1109/ICCCWorkshops62562.2024.10693839
M3 - 会议稿件
AN - SCOPUS:85207648921
T3 - International Conference on Communications in China, ICCC Workshops 2024
SP - 569
EP - 574
BT - International Conference on Communications in China, ICCC Workshops 2024
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2024 IEEE/CIC International Conference on Communications in China, ICCC Workshops 2024
Y2 - 7 August 2024 through 9 August 2024
ER -