Reference : Efficient Numerical Methods for Secrecy Capacity of Gaussian MIMO Wiretap Channel
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Security, Reliability and Trust
Efficient Numerical Methods for Secrecy Capacity of Gaussian MIMO Wiretap Channel
Mukherjee, Anshu []
Ottersten, Björn mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Tran, Le Nam []
2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring)
2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring)
25-04-2021 to 25-04-2021
[en] This paper presents two different low-complexity methods for obtaining the secrecy capacity of multiple-input multiple-output (MIMO) wiretap channel subject to a sum power constraint (SPC). The challenges in deriving computationally efficient solutions to the secrecy capacity problem are due to the fact that the secrecy rate is a difference of convex functions (DC) of the transmit covariance matrix, for which its convexity is only known for the degraded case. In the first method, we capitalize on the accelerated DC algorithm, which requires solving a sequence of convex subproblems. In particular, we show that each subproblem indeed admits a water-filling solution. In the second method, based on the equivalent convex-concave reformulation of the secrecy capacity problem, we develop a so-called partial best response algorithm (PBRA). Each iteration of the PBRA is also done in closed form. Simulation results are provided to demonstrate the superior performance of the proposed methods.

File(s) associated to this reference

Fulltext file(s):

Limited access
Efficient_Numerical_Methods_for_Secrecy_Capacity_of_Gaussian_MIMO_Wiretap_Channel.pdfPublisher postprint2.15 MBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.