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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Efficient Numerical Methods for Secrecy Capacity of Gaussian MIMO Wiretap Channel


    Contributors:


    Publication date :

    2021-04-01


    Size :

    2201964 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    On the Average Secrecy Capacity for FSO Wiretap Channels with Nonzero Boresight Pointing Errors

    Boluda-Ruiz, Ruben / Castillo-Vazquez, Carmen / Castillo-Vazquez, Beatriz et al. | IEEE | 2018


    Full-Duplex MIMO Small-Cells: Secrecy Capacity Analysis

    Babaei, Ayda / Aghvami, A. Hamid / Shojaeifard, Arman et al. | IEEE | 2018