Iterative distributed minimum total-MSE approach for secure communications in MIMO interference channels
Zhengmin Kong, Shaoshi Yang, Feilong Wu, Shixin Peng, Liang Zhong and, Lajos Hanzo

TL;DR
This paper proposes an iterative distributed algorithm for secure MIMO interference channel communications, jointly designing transmit and receive matrices to maximize secrecy and minimize MSE under power constraints.
Contribution
It introduces a novel joint design method based on minimum total MSE criterion, outperforming traditional interference alignment in secure MIMO systems.
Findings
The algorithm guarantees secure communication even against strong eavesdroppers.
It outperforms traditional interference alignment in secrecy rate and MSE.
Convergence of the iterative algorithm is theoretically characterized.
Abstract
In this paper, we consider the problem of joint transmit precoding (TPC) matrix and receive filter matrix design subject to both secrecy and per-transmitter power constraints in the MIMO interference channel, where legitimate transmitter-receiver pairs communicate in the presence of an external eavesdropper. Explicitly, we jointly design the TPC and receive filter matrices based on the minimum total mean-squared error (MT-MSE) criterion under a given and feasible information-theoretic degrees of freedom. More specifically, we formulate this problem by minimizing the total MSEs of the signals communicated between the legitimate transmitter-receiver pairs, whilst ensuring that the MSE of the signals decoded by the eavesdropper remains higher than a certain threshold. We demonstrate that the joint design of the TPC and receive filter matrices subject to both secrecy and transmit power…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
