A Low-Complexity Algorithm for Achieving Secrecy Capacity in MIMO Wiretap Channels

We consider a secure transmission including a transmitter, a receiver and an eavesdropper, each being equipped with multiple antennas. The aim is to develop a low-complexity and scalable method to find a globally optimal solution to the problem of secrecy rate maximization under a total power constraint at the transmitter. In principle, the original formulation of the problem is nonconvex. However, it can be equivalently translated into finding a saddle point of a minimax convex-concave program. An existing approach finds the saddle point using the Newton method, whose computational cost increases quickly with the number of transmit antennas, making it unsuitable for large scale antenna systems. To this end, we propose an iterative algorithm based on alternating optimization, which is guaranteed to converge to a saddle point, and thus achieves a globally optimal solution to the considered problem. In particular, each subproblem of the proposed iterative method admits a closed-form solution. We analytically show that the iteration cost of our proposed method is much cheaper than that of the known solution. As a result, numerical results demonstrate that the proposed method remarkably outperforms the existing one in terms of the overall run time.

Authors:
Nguyen Thang Van, Vu Quang-Doanh, Juntti Markku, Tran Le-Nam

Publication type:
A4 Article in conference proceedings

Place of publication:
ICC 2020 – 2020 IEEE International Conference on Communications (ICC)

Keywords:
6G Publication

Published:
27 July 2020

Full citation:
T. V. Nguyen, Q. Vu, M. Juntti and L. Tran, “A Low-Complexity Algorithm for Achieving Secrecy Capacity in MIMO Wiretap Channels,” ICC 2020 – 2020 IEEE International Conference on Communications (ICC), Dublin, Ireland, 2020, pp. 1-6, doi: 10.1109/ICC40277.2020.9149178

DOI:
https://doi.org/10.1109/ICC40277.2020.9149178

Read the publication here:
http://urn.fi/urn:nbn:fi-fe2020090267163