Joint Transmitter Design for Robust Secure Radar-Communication Coexistence Systems
Peng Liu, Zesong Fei, Xinyi Wang, Zhong Zheng, Xiangnan Li, Jie Xu
TL;DR
The paper addresses spectrum sharing between a MISO secure downlink and a MIMO radar in the presence of an eavesdropper with norm-bounded CSI errors. It develops a two-layer robust cooperative design that jointly optimizes the BS beamformer $oldsymbol{t}$ and radar waveform covariance $oldsymbol{R}_x$ to maximize the worst-case secrecy rate, defined as $C_s=[R_b-R_e]^+$, while meeting radar beampattern and interference constraints. A semidefinite relaxation (SDR) is used to drop rank constraints and a S-lemma–based transformation (along with a Charnes–Cooper change of variables) converts uncertain quadratic constraints into linear matrix inequalities, with a one-dimensional outer search over the parameter $oldsymbol{bc}$. Simulations show substantial secrecy-rate gains over non-robust and FP-based schemes and reveal a fundamental trade-off between radar detection probability and secure communication performance.
Abstract
This paper investigates the spectrum sharing between a multiple-input single-output (MISO) secure communication system and a multiple-input multiple-output (MIMO) radar system in the presence of one suspicious eavesdropper. We jointly design the radar waveform and communication beamforming vector at the two systems, such that the interference between the base station (BS) and radar is reduced, and the detrimental radar interference to the communication system is enhanced to jam the eavesdropper, thereby increasing secure information transmission performance. In particular, by considering the imperfect channel state information (CSI) for the user and eavesdropper, we maximize the worst-case secrecy rate at the user, while ensuring the detection performance of radar system. To tackle this challenging problem, we propose a two-layer robust cooperative algorithm based on the S-lemma and semidefinite relaxation techniques. Simulation results demonstrate that the proposed algorithm achieves significant secrecy rate gains over the non-robust scheme. Furthermore, we illustrate the trade-off between secrecy rate and detection probability.
