Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1908.00994 · IEEE Transactions on Communications

A Rotation-Based Method for Precoding in Gaussian MIMOME Channels

Xinliang Zhang, Yue Qi, Mojtaba Vaezi

Published Nov 6, 2020• 26 citations
arXivHTMLPDF

Abstract

The problem of maximizing secrecy rate of multiple-input multiple-output multiple-eavesdropper (MIMOME) channels with arbitrary numbers of antennas at each node is studied in this paper. First, the optimization problem corresponding to the secrecy capacity of the MIMOME channel is converted to an equivalent optimization based on Givens rotations and eigenvalue decomposition of the covariance matrix. In this new formulation, precoder is a rotation matrix which results in a positive semi-definite (PSD) covariance matrix by construction. This removes the PSD matrix constraint and makes the problem easier to tackle. Next, a Broyden-Fletcher-Goldfarb-Shanno (BFGS)-based algorithm is developed to find the rotation and power allocation parameters. Further, the generalized singular value decomposition (GSVD)-based precoding is used to initialize this algorithm. The proposed rotation-BFGS method provides an efficient approach to find a near-optimal transmit strategy for the MIMOME channel and outperforms various state-of-the-art analytical and numerical methods. In particular, the rotation-BFGS precoding achieves higher secrecy rates than the celebrated GSVD precoding, with a reasonably higher computational complexity. Extensive numerical results elaborate on the effectiveness of the rotation-BFGS precoding. The new framework developed in this paper can be applied to a variety of similar problems in the context of multi-antenna channels with and without secrecy.

DOI
10.1109/tcomm.2020.3036439

Related papers

A New Precoding for the MIMO Gaussian Channel with Multi-Antenna Eavesdroppers

Xinliang Zhang, Yue Qi, Mojtaba Vaezi

The problem of maximizing the secrecy rate of multiple-input multiple-output multiple-eavesdropper (MI-MOME) channels with arbitrary numbers of antennas at each node is studied in this paper. It is shown that optimal precoding can be formed using a rotation matrix in an nt-dimensional space where ntis the number of antennas at the transmitter. Next, a gradient-descent based method is developed to find the rotation and power allocation parameters. The proposed rotation-based method can be applied to the MIMOME channel with arbitrary numbers of antennas at each node and outperforms state-of-the-art solutions. In particular, it achieves higher secrecy rates than generalized singular value decomposition (GSVD)-based precoding. Further, GSVD-based precoding is used to initialize the rotation-based precoding and this combination provides an efficient approach to find a near-optimal transmit strategy for the MIMOME channel. The rotation-based precoding can be applied to related problems in multi-antenna channels. Numerous simulation results show that the rotation-based method outperforms existing methods in terms of performance and computational complexity.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Aug 1, 2020•1 citation

MIMO Gaussian wiretap channels with two transmit antennas: Optimal precoding and power allocation

Mojtaba Vaezi, Wonjae Shin, H. Vincent Poor +1 more

A Gaussian multiple-input multiple-output wiretap channel in which the eavesdropper and legitimate receiver are equipped with arbitrary numbers of antennas and the transmitter has two antennas is studied in this paper. It is shown that the secrecy capacity of this channel can be achieved by linear precoding. The optimal precoding and power allocation schemes achieving the secrecy capacity are developed subsequently, and the secrecy capacity is compared with the generalized singular value decomposition (GSVD)-based precoding, which is the best previously proposed precoding for this problem. Numerical results show that substantial gain can be obtained in secrecy rate between the proposed and GSVD-based precodings.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2017•8 citations

Optimal Beamforming for Gaussian MIMO Wiretap Channels With Two Transmit Antennas

Mojtaba Vaezi, Wonjae Shin, H. Vincent Poor

A Gaussian multiple-input multiple-output wiretap channel in which the eavesdropper and legitimate receiver are equipped with arbitrary numbers of antennas and the transmitter has two antennas is studied in this paper. The input covariance matrix that achieves the secrecy capacity is determined. In particular, it is shown that the secrecy capacity of this channel can be achieved by linear precoding. Precoding and power allocation schemes that maximize the achievable secrecy rate, and thus achieve the secrecy capacity, are developed. The secrecy capacity is then compared with the achievable secrecy rate of generalized singular value decomposition (GSVD)-based precoding, which is the best previously proposed technique for this problem. Numerical results demonstrate that substantial gain can be obtained in secrecy rate between the proposed and GSVD-based precodings.

arXiv:1707.06271•IEEE Transactions on Wireless Communications•Jul 25, 2017•28 citations

Optimal power allocation for GSVD-based beamforming in the MIMO Gaussian wiretap channel

S. Ali. A. Fakoorian, Arnold Lee Swindlehurst

This paper considers a multiple-input multiple-output (MIMO) Gaussian wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each equipped with multiple antennas. Perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while ensuring that the eavesdropper gets zero bits of information. In this paper, the perfect secrecy rate of the multiple antenna MIMO wiretap channel is maximized for arbitrary numbers of antennas under the assumption that the transmitter performs beamforming based on the generalized singular value decomposition (GSVD). More precisely, the optimal allocation of power for the GSVD-based precoder that maximizes the achievable secrecy rate is derived. Numerical results are presented to illustrate that the achievable secrecy rate of the GSVD-based precoding approach is nearly identical to that of the optimal scheme.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2012•83 citations

Optimal Power Allocation for GSVD-Based Beamforming in the MIMO Wiretap Channel

S. Ali. A. Fakoorian, Arnold Lee Swindlehurst

This paper considers a multiple-input multiple-output (MIMO) Gaussian wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each equipped with multiple antennas. Perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while ensuring that the eavesdropper gets zero bits of information. In this paper, the perfect secrecy capacity of the multiple antenna MIMO wiretap channel is found for aribtrary numbers of antennas under the assumption that the transmitter performs beamforming based on the generalized singular value decomposition (GSVD). More precisely, the optimal allocation of power for the GSVD-based precoder that achieves the secrecy capacity is derived. This solution is shown to have several advantages over prior work that considered secrecy capacity for the general MIMO Gaussian wiretap channel under a high SNR assumption. Numerical results are presented to illustrate the proposed theoretical findings.

arXiv:1006.1890•Jun 9, 2010•18 citations

Linear Precoding for Finite-Alphabet Signaling Over MIMOME Wiretap Channels

Yongpeng Wu, Chengshan Xiao, Zhi Jun Ding +2 more

In this paper, we investigate the secrecy rate of finite-alphabet communications over multiple-input-multiple-output-multiple-antenna eavesdropper (MIMOME) channels. Traditional precoding designs based on Gaussian input assumption may lead to substantial secrecy rate loss when the Gaussian input is replaced by practical finite-alphabet input. To address this issue, we investigate linear precoding designs to directly maximize the secrecy rate for MIMOME systems under the constraint of finite-alphabet input. By exploiting the theory of Karush-Kuhn-Tucker (KKT) analysis and matrix calculus, we first present necessary conditions of the optimal precoding design when instantaneous channel-state information (CSI) of the eavesdropper is known at the transmitter. In this light, an iterative algorithm for finding the optimal precoding matrix is developed, utilizing a gradient decent method with backtracking line search. Moreover, we find that the beamforming design in MIMONE systems, which is a secrecy-capacity-achieving approach for Gaussian signaling, no longer provides the maximum secrecy rate for finite-alphabet input data. This case is substantially different from the Gaussian input case. In addition, we derive the closed-form results on the precoding matrix, which maximizes the secrecy rate in the low signal-to-noise ratio (SNR) region, and reveal the optimal precoding structure in the high-SNR region. A novel jamming signal generation method that draws on the CSI of the eavesdropper to additionally increase the secrecy rate is further proposed. The precoding design with only statistical CSI of the eavesdropper available at the transmitter is also considered. Numerical results show that the proposed designs provide significant gains over recent precoding designs through a power control policy and the precoding design with the Gaussian input assumption in various scenarios.

IEEE Transactions on Vehicular Technology•Apr 20, 2012•128 citations
The problem of maximizing secrecy rate of multiple-input multiple-output multiple-eavesdropper (MIMOME) channels with arbitrary numbers of antennas at each node is studied in this paper. First, the optimization problem corresponding to the secrecy capacity of the MIMOME channel is converted to an equivalent optimization based on Givens rotations and eigenvalue decomposition of the covariance matrix. In this new formulation, precoder is a rotation matrix which results in a positive semi-definite (PSD) covariance matrix by construction. This removes the PSD matrix constraint and makes the problem easier to tackle. Next, a Broyden-Fletcher-Goldfarb-Shanno (BFGS)-based algorithm is developed to find the rotation and power allocation parameters. Further, the generalized singular value decomposition (GSVD)-based precoding is used to initialize this algorithm. The proposed rotation-BFGS method provides an efficient approach to find a near-optimal transmit strategy for the MIMOME channel and outperforms various state-of-the-art analytical and numerical methods. In particular, the rotation-BFGS precoding achieves higher secrecy rates than the celebrated GSVD precoding, with a reasonably higher computational complexity. Extensive numerical results elaborate on the effectiveness of the rotation-BFGS precoding. The new framework developed in this paper can be applied to a variety of similar problems in the context of multi-antenna channels with and without secrecy.
The problem of maximizing the secrecy rate of multiple-input multiple-output multiple-eavesdropper (MI-MOME) channels with arbitrary numbers of antennas at each node is studied in this paper. It is shown that optimal precoding can be formed using a rotation matrix in an nt-dimensional space where ntis the number of antennas at the transmitter. Next, a gradient-descent based method is developed to find the rotation and power allocation parameters. The proposed rotation-based method can be applied to the MIMOME channel with arbitrary numbers of antennas at each node and outperforms state-of-the-art solutions. In particular, it achieves higher secrecy rates than generalized singular value decomposition (GSVD)-based precoding. Further, GSVD-based precoding is used to initialize the rotation-based precoding and this combination provides an efficient approach to find a near-optimal transmit strategy for the MIMOME channel. The rotation-based precoding can be applied to related problems in multi-antenna channels. Numerous simulation results show that the rotation-based method outperforms existing methods in terms of performance and computational complexity.
A Gaussian multiple-input multiple-output wiretap channel in which the eavesdropper and legitimate receiver are equipped with arbitrary numbers of antennas and the transmitter has two antennas is studied in this paper. It is shown that the secrecy capacity of this channel can be achieved by linear precoding. The optimal precoding and power allocation schemes achieving the secrecy capacity are developed subsequently, and the secrecy capacity is compared with the generalized singular value decomposition (GSVD)-based precoding, which is the best previously proposed precoding for this problem. Numerical results show that substantial gain can be obtained in secrecy rate between the proposed and GSVD-based precodings.
A Gaussian multiple-input multiple-output wiretap channel in which the eavesdropper and legitimate receiver are equipped with arbitrary numbers of antennas and the transmitter has two antennas is studied in this paper. The input covariance matrix that achieves the secrecy capacity is determined. In particular, it is shown that the secrecy capacity of this channel can be achieved by linear precoding. Precoding and power allocation schemes that maximize the achievable secrecy rate, and thus achieve the secrecy capacity, are developed. The secrecy capacity is then compared with the achievable secrecy rate of generalized singular value decomposition (GSVD)-based precoding, which is the best previously proposed technique for this problem. Numerical results demonstrate that substantial gain can be obtained in secrecy rate between the proposed and GSVD-based precodings.
This paper considers a multiple-input multiple-output (MIMO) Gaussian wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each equipped with multiple antennas. Perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while ensuring that the eavesdropper gets zero bits of information. In this paper, the perfect secrecy rate of the multiple antenna MIMO wiretap channel is maximized for arbitrary numbers of antennas under the assumption that the transmitter performs beamforming based on the generalized singular value decomposition (GSVD). More precisely, the optimal allocation of power for the GSVD-based precoder that maximizes the achievable secrecy rate is derived. Numerical results are presented to illustrate that the achievable secrecy rate of the GSVD-based precoding approach is nearly identical to that of the optimal scheme.
This paper considers a multiple-input multiple-output (MIMO) Gaussian wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each equipped with multiple antennas. Perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while ensuring that the eavesdropper gets zero bits of information. In this paper, the perfect secrecy capacity of the multiple antenna MIMO wiretap channel is found for aribtrary numbers of antennas under the assumption that the transmitter performs beamforming based on the generalized singular value decomposition (GSVD). More precisely, the optimal allocation of power for the GSVD-based precoder that achieves the secrecy capacity is derived. This solution is shown to have several advantages over prior work that considered secrecy capacity for the general MIMO Gaussian wiretap channel under a high SNR assumption. Numerical results are presented to illustrate the proposed theoretical findings.
In this paper, we investigate the secrecy rate of finite-alphabet communications over multiple-input-multiple-output-multiple-antenna eavesdropper (MIMOME) channels. Traditional precoding designs based on Gaussian input assumption may lead to substantial secrecy rate loss when the Gaussian input is replaced by practical finite-alphabet input. To address this issue, we investigate linear precoding designs to directly maximize the secrecy rate for MIMOME systems under the constraint of finite-alphabet input. By exploiting the theory of Karush-Kuhn-Tucker (KKT) analysis and matrix calculus, we first present necessary conditions of the optimal precoding design when instantaneous channel-state information (CSI) of the eavesdropper is known at the transmitter. In this light, an iterative algorithm for finding the optimal precoding matrix is developed, utilizing a gradient decent method with backtracking line search. Moreover, we find that the beamforming design in MIMONE systems, which is a secrecy-capacity-achieving approach for Gaussian signaling, no longer provides the maximum secrecy rate for finite-alphabet input data. This case is substantially different from the Gaussian input case. In addition, we derive the closed-form results on the precoding matrix, which maximizes the secrecy rate in the low signal-to-noise ratio (SNR) region, and reveal the optimal precoding structure in the high-SNR region. A novel jamming signal generation method that draws on the CSI of the eavesdropper to additionally increase the secrecy rate is further proposed. The precoding design with only statistical CSI of the eavesdropper available at the transmitter is also considered. Numerical results show that the proposed designs provide significant gains over recent precoding designs through a power control policy and the precoding design with the Gaussian input assumption in various scenarios.