Joint information- and jamming-beamforming for full duplex secure communication

In this paper, we design joint information beam-forming and jamming beamforming to guarantee both transmit security and receive security for a full duplex base station (FD-BS). Specifically, we aim to maximize the secret transmit rate while constrain the secret receive rate to be greater than a predefined bound. We convert the original non-convex problem into a new sequence of subproblems where the semidefinite programming (SDP) relaxation can be applied to efficiently find the optimal solutions. We strictly prove that such a relaxation does not change the optimality for these subproblems. Then the global optimal solutions of the original non-convex problem can be obtained via a one-dimensional search. Simulation results are provided to verify the efficiency of the proposed algorithms.