Joint transceiver designs for secure communications over MIMO relay

This paper addresses the transceiver design problem for secure downlink communications over a multiple-input multiple-output (MIMO) relay system in the presence of multiple eavesdroppers. A new algorithm based on alternating optimization (AO) is first proposed to maximize the signal-to-noise ratio (SNR) of a legitimate receiver under power constraints at the base station (BS) and the relay station (RS) and a set of secrecy constraints, by using the semidefinite relaxation (SDR) technique. To reduce complexity, a simplified design algorithm based on switched relaying (SR) is also proposed, in which both the BS and the RS are equipped with a codebook of permutation matrices. Based on this codebook, we construct a number of latent transceivers, each consisting of a BS beamforming vector and an optimally scaled RS permutation matrix. We use the bisection search and second-order cone programming (SOCP) techniques to design each latent transceiver and choose the optimal one with the largest SNR. We also develop an efficient approach to construct the codebook of permutation matrices. Our results show that the SR based algorithm significantly reduces the computational complexity while maintaining a similar performance to the AO based algorithm.

Paper

Full text

PDF

Joint transceiver designs for secure communications over MIMO relay

Semantic Scholar · Computer Science · 2016

Abstract

This paper addresses the transceiver design problem for secure downlink communications over a multiple-input multiple-output (MIMO) relay system in the presence of multiple eavesdroppers. A new algorithm based on alternating optimization (AO) is first proposed to maximize the signal-to-noise ratio (SNR) of a legitimate receiver under power constraints at the base station (BS) and the relay station (RS) and a set of secrecy constraints, by using the semidefinite relaxation (SDR) technique. To reduce complexity, a simplified design algorithm based on switched relaying (SR) is also proposed, in which both the BS and the RS are equipped with a codebook of permutation matrices. Based on this codebook, we construct a number of latent transceivers, each consisting of a BS beamforming vector and an optimally scaled RS permutation matrix. We use the bisection search and second-order cone programming (SOCP) techniques to design each latent transceiver and choose the optimal one with the largest SNR. We also develop an efficient approach to construct the codebook of permutation matrices. Our results show that the SR based algorithm significantly reduces the computational complexity while maintaining a similar performance to the AO based algorithm.

Similar papers

© 2026 NYSGPT2525 LLC