2020/12/10 by Anshu Mukherjee, Björn Ottersten, Mukherjee, Anshu +3 · 1 citation
Engineering · #Advanced MIMO Systems Optimization #Energy Harvesting in Wireless Networks #FOS: Computer and information sciences #FOS: Electrical engineering #Information Theory (cs.IT) #Signal Processing (eess.SP) #Wireless Communication Security Techniques #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2012.05667
openalex publication_date 2020/12/10 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28
This paper presents novel numerical approaches to finding the secrecy\ncapacity of the multiple-input multiple-output (MIMO) wiretap channel subject\nto multiple linear transmit covariance constraints, including sum power\nconstraint, per antenna power constraints and interference power constraint. An\nanalytical solution to this problem is not known and existing numerical\nsolutions suffer from slow convergence rate and/or high per-iteration\ncomplexity. Deriving computationally efficient solutions to the secrecy\ncapacity problem is challenging since the secrecy rate is expressed as a\ndifference of convex functions (DC) of the transmit covariance matrix, for\nwhich its convexity is only known for some special cases. In this paper we\npropose two low-complexity methods to compute the secrecy capacity along with a\nconvex reformulation for degraded channels. In the first method we capitalize\non the accelerated DC algorithm which requires solving a sequence of convex\nsubproblems, for which we propose an efficient iterative algorithm where each\niteration admits a closed-form solution. In the second method, we rely on the\nconcave-convex equivalent reformulation of the secrecy capacity problem which\nallows us to derive the so-called partial best response algorithm to obtain an\noptimal solution. Notably, each iteration of the second method can also be done\nin closed form. The simulation results demonstrate a faster convergence rate of\nour methods compared to other known solutions. We carry out extensive numerical\nexperiments to evaluate the impact of various parameters on the achieved\nsecrecy capacity.\n