A minorization-maximization algorithm for an-based mimome secrecy rate maximization
Author | Masood, Mudassir |
Author | Ghrayeb, Ali |
Author | Babu, Prabhu |
Author | Khalil, Issa |
Author | Hasna, Mazen |
Available date | 2020-10-12T09:21:47Z |
Publication Date | 2017 |
Publication Name | 2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016 - Proceedings |
Resource | Scopus |
Abstract | We consider the problem of secrecy rate maximization in a multi-input multi-output multi-eavesdropper (MIMOME) wiretap channel and present an exact solution. A general system model with a multi-antenna eavesdropper and a multi-antenna full-duplex receiver is considered. In particular, we perform joint beamforming and artificial noise optimization in an effort to maximize the achievable secrecy rate. The optimization is performed in the presence of artificial noise generated by both transmitter and legitimate receiver. The resulting optimization problem is non-convex and difficult to solve. We develop a minorization-maximization algorithm to solve the problem. It is iterative in nature and guaranteed to converge to a locally optimal solution. The results can therefore be used to benchmark existing methods. Numerical results are presented to demonstrate the efficacy of the proposed approach. |
Sponsor | This work was made possible by NPRP grant NPRP 8-052-2-029 from the Qatar National Research Fund (a member of Qatar Foundation). The statements made herein are solely the responsibility of the authors. |
Language | en |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Subject | algorithm an-based mimome secrecy rate |
Type | Conference Paper |
Pagination | 975-980 |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
-
Electrical Engineering [2649 items ]