University of Oulu

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

A low-complexity algorithm for achieving secrecy capacity in MIMO wiretap channels

Saved in:
Author: Nguyen, Thang Van1; Vu, Quang-Doanh2; Juntti, Markku2;
Organizations: 1School of Electrical and Electronic Engineering, University College Dublin, Ireland
2Centre for Wireless Communications, University of Oulu, P.O.Box 4500, FI-90014 University of Oulu, Finland
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 0.2 MB)
Persistent link: http://urn.fi/urn:nbn:fi-fe2020090267163
Language: English
Published: Institute of Electrical and Electronics Engineers, 2020
Publish Date: 2020-09-02
Description:

Abstract

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.

see all

Series: IEEE International Conference on Communications
ISSN: 1550-3607
ISSN-E: 1938-1883
ISSN-L: 1550-3607
ISBN: 978-1-7281-5089-5
ISBN Print: 978-1-7281-5090-1
Pages: 1 - 6
DOI: 10.1109/ICC40277.2020.9149178
OADOI: https://oadoi.org/10.1109/ICC40277.2020.9149178
Host publication: ICC 2020 - 2020 IEEE International Conference on Communications (ICC)
Conference: IEEE International Conference on Communications
Type of Publication: A4 Article in conference proceedings
Field of Science: 213 Electronic, automation and communications engineering, electronics
Subjects:
Funding: This publication has emanated from research supported in part by a Grant from Science Foundation Ireland under Grant number 17/CDA/4786. This work was supported in part by the Academy of Finland under projects FURMESFuN (Grant31089), and 6Genesis Flagship (Grant 318927).
Academy of Finland Grant Number: 31089
318927
Detailed Information: 31089 (Academy of Finland Funding decision)
318927 (Academy of Finland Funding decision)
Copyright information: © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.