Secrecy rate maximization for MIMO Gaussian wiretap channels with multiple eavesdroppers via alternating matrix POTDC
Authors:
- 1 May 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5 (15206149) , 5686-5690
Abstract
In this paper, we consider the problem of optimizing the transmit co-variance matrix for a multiple-input multiple-output (MIMO) Gaussian wiretap channel. The scenario of interest consists of a transmitter, a legitimate receiver, and multiple non-cooperating eavesdroppers that are all equipped with multiple antennas. Specifically, we design the transmit covariance matrix by maximizing the secrecy rate under a total power constraint, which is a non-convex difference of convex functions (DC) programming problem. We develop an algorithm, termed alternating matrix POTDC algorithm, based on alternating optimization of the eigenvalues and the eigenvectors of the transmit covariance matrix. The proposed alternating matrix POTDC method provides insights into the non-convex nature of the problem and is very general, i.e., additional constraints on the co-variance matrix can easily be incorporated. The secrecy rate performance of the proposed algorithm is demonstrated by simulations.Keywords
This publication has 17 references indexed in Scilit:
- Robust Adaptive Beamforming for General-Rank Signal Model With Positive Semi-Definite Constraint via POTDCIEEE Transactions on Signal Processing, 2013
- Transmit Solutions for MIMO Wiretap Channels using Alternating OptimizationIEEE Journal on Selected Areas in Communications, 2013
- An alternating optimization algorithm for the MIMO secrecy capacity problem under sum power and per-antenna power constraints2013
- SLNR-Based Transmit Beamforming for MIMO Wiretap ChannelWireless Personal Communications, 2012
- Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming ProblemsIEEE Transactions on Signal Processing, 2012
- Conjugate gradient algorithm for optimization under unitary matrix constraintSignal Processing, 2009
- A Note on the Secrecy Capacity of the Multiple-Antenna Wiretap ChannelIEEE Transactions on Information Theory, 2009
- Convex Optimization2004
- Optimization algorithms exploiting unitary constraintsIEEE Transactions on Signal Processing, 2002
- Various proofs of Sylvester's (determinant) identityMathematics and Computers in Simulation, 1996