Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Multiple-Antenna Eavesdropper

This paper studies different secrecy rate optimization problems for a multiple-input–multiple-output (MIMO) secrecy channel. In particular, we consider a scenario where a communication through a MIMO channel is overheard by a multiple-antenna eavesdropper. In this secrecy network, we first investigate two secrecy rate optimization problems: 1) power minimization and 2) secrecy rate maximization. These optimization problems are not convex due to the nonconvex secrecy rate constraint. However, by approximating this secrecy rate constraint based on Taylor series expansion, we propose iterative algorithms to solve these secrecy rate optimization problems. In addition, we provide the convergence analysis for the proposed algorithms. These iterative optimization approaches are developed under the assumption that the transmitter has perfect channel state information. However, there are practical difficulties in having perfect channel state information at the transmitter. Hence, robust secrecy rate optimization techniques based on the worst-case secrecy rate are considered by incorporating channel uncertainties. By exploiting the S-Procedure , we show that these robust optimization problems can be formulated into semidefinite programming at low signal-to-noise ratios (SNRs). Simulation results have been provided to validate the convergence of the proposed algorithms. In addition, numerical results show that the proposed robust optimization techniques outperform the nonrobust schemes in terms of the worst-case secrecy rates and the achieved secrecy rates.