Efficient Algorithm for Selecting Secrecy Rate Maximizing Antennas

Antenna selection (AS) is poised to provide solutions to hardware complexity issues while guaranteeing untappable information flow. We investigate the AS problem set up in the context of linear precoder design for secrecy rate maximization of a multiple-input single-output system. The original problem is both non-tractable and nonconvex. We propose a provably convergent iterative procedure that sequentially solves a series of convex programs. The proposed algorithm is then refined to yield a precoder of desired sparsity. Finally, numerical experiments are performed to study the execution of AS algorithm from various different aspects.