Abstract
In this letter, secure beamforming designs are investigated in a multiple-input multiple-output secrecy channels with simultaneous wireless information and power transfer. In order to achieve fairness among different multiple energy harvesting receivers, the minimum harvested energy is maximized under the secrecy rate requirements. In particular, in order to reduce the computational complexity of the semidefinite programming problem, a successive convex approximation (SCA) iterative algorithm is proposed in the perfect channel state information (CSI) case to obtain a near-optimal rank-one solution. Moreover, the original problem is extended to the imperfect CSI case by incorporating a norm-bounded error model, where an SCA-based iterative algorithm is also proposed. Simulation results reveal that the SCA-based iterative algorithm achieves the same performance as the semidefinite relaxation method with reduced complexity.