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

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

Robust secure goodput for massive MIMO and optical fiber wiretap channels

Andrew Lonnstrom, Eduard Axel Jorswieck, Daniel Haufe, J. Czarske

Published Jul 1, 2017• 4 citations
Publisher

Abstract

We propose a method for optimizing the information theoretic secure goodput of a multiple-input multiple-output (MIMO) degraded wiretap channel using inverse precoding. We evaluate the secrecy capacity of this method in terms of secure goodput under various aspects using a standard fading massive MIMO system under the assumption of perfect channel state information (CSI) at the transmitter for the legitimate channel and no CSI at the transmitter for the eavesdropper channel. The precoding scheme optimizes two parameters, the number of compromised streams and the channel advantage of the legitimate receiver. The resulting secure goodput can be specialized to massive MIMO or optical channels with single or multiple eavesdroppers. We include a numerical analysis of the secure goodput for a multi-mode fiber (MMF) optical channel to demonstrate the flexibility of our approach.

DOI
10.1109/spawc.2017.8227702

Related papers

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

Near-Optimal Precoding Design for MIMO Gaussian Wiretap Channel under Power Constraint

Lingxiang Li, Zhi Chen, Jun Fang

We consider the optimal precoding design under power constraint for the Gaussian MIMO wiretap channel with a transmitter, a legitimate receiver, and an eavesdropper, each equipped with arbitrary number of antennas. The transmitter has access to full channel state information (CSI) of the legitimate link and eavesdropper link. Such an optimization problem is non-convex and an analytical optimal solution is difficult to obtain. In this paper, by resorting to the majorization theory, we develop a theoretical upper bound on the secrecy capacity which is proved useful in evaluating existing sub-optimal methods. Our analysis shows that, given that the number of antennas at the eavesdropper is no less than that of the transmitter, the generalized singular value decomposition (GSVD)-based method proposed in [1], albeit generally non-optimal, provides a near-optimal solution to the MIMO wiretap precoding design in the high signal-to-noise ratio (SNR) regime. Numerical results are provided to corroborate our theoretical results.

IEEE Military Communications Conference (MILCOM)•Nov 1, 2013•0 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

Linear MMSE transceiver optimization for general MIMO wiretap channels with QoS constraints

Minyan Pei, Lei Wang, Dongtang Ma

In this paper, we investigate the problem of jointly designing optimum linear precoder and decoder with secrecy constraints, where two legitimate parties communicate in the presence of an eavesdropper over multiple-input multiple-output (MIMO) Gaussian channels. In particular, we focus on optimizing the linear transceiver to guarantee a certain quality of service (QoS) level for the legitimate receiver in terms of mean square error (MSE), whilst employing the artificial noise to maximally degrade the MSE for the eavesdropper. We assume that the transmitter may not or may have the channel state information (CSI) for the eavesdropper, and then propose two design formulations. With the aid of majorization theory, we characterize the forms of optimal transmit precoder when both the legitimate receiver and the eavesdropper employ the optimal linear MMSE receiver. Numerical results illustrate main conclusions.

IEEE/CIC International Conference on Communications in China (ICCC)•Aug 1, 2013•7 citations

Secrecy in MIMO Networks with No Eavesdropper CSIT

Pritam Mukherjee, Şennur Ulukuş

We consider two fundamental multi-user channel models: the multiple-input multiple-output (MIMO) wiretap channel with one helper (WTH) and the MIMO multiple access wiretap (MAC-WT) channel. In each case, the eavesdropper has K antennas while the remaining terminals have N antennas each. We consider a fast fading channel where the channel state information (CSI) of the legitimate receiver is available at the transmitters but no CSI at the transmitters (CSIT) is available for the eavesdropper's channel. We determine the optimal sum secure degrees of freedom (s.d.o.f.) for each channel model for the regime K ≤ N, and show that in this regime, the MAC-WT channel reduces to the WTH in the absence of eavesdropper CSIT. For the regime N ≤ K ≤ 2N, we obtain the optimal linear s.d.o.f., and show that the MAC-WT channel and the WTH have the same optimal s.d.o.f. when restricted to linear encoding strategies. In the absence of any such restrictions, we provide an upper bound for the sum s.d.o.f. of the MAC-WT channel in the regime N ≤ K ≤ 2N. Our results show that unlike in the single-input single-output case, there is loss of s.d.o.f. for even the WTH due to lack of eavesdropper CSIT when K ≥ N.

arXiv:1610.03475•IEEE Transactions on Communications•Jan 1, 2017•12 citations

Robust Outage Secrecy Rate Optimizations for a MIMO Secrecy Channel

Zheng Chu, Kanapathippillai Cumanan, Zhiguo Ding +2 more

This letter investigates robust secrecy rate optimization techniques for a multiple-input-multiple-output (MIMO) wiretap channel in the presence of a multiantenna eavesdropper. In particular, two robust secrecy rate optimization problems are studied: robust power minimization with an outage secrecy rate constraint and robust secrecy rate maximization subject to the outage secrecy rate and transmit power constraints. Here, it is assumed that the legitimate transmitter has perfect channel state information (CSI) of the legitimate receiver and imperfect CSI of the eavesdropper. Both robust problems are not convex in terms of transmit covariance matrix and the outage secrecy rate constraint. Hence, we propose a conservative approximation approach to reformulate this outage secrecy rate constraint by exploiting the Bernstein-type inequality to obtain a tractable solution for these two robust problems. Numerical results have been provided to validate the convergence and the performance of the proposed robust algorithms.

IEEE Wireless Communications Letters•Nov 26, 2014•65 citations
We propose a method for optimizing the information theoretic secure goodput of a multiple-input multiple-output (MIMO) degraded wiretap channel using inverse precoding. We evaluate the secrecy capacity of this method in terms of secure goodput under various aspects using a standard fading massive MIMO system under the assumption of perfect channel state information (CSI) at the transmitter for the legitimate channel and no CSI at the transmitter for the eavesdropper channel. The precoding scheme optimizes two parameters, the number of compromised streams and the channel advantage of the legitimate receiver. The resulting secure goodput can be specialized to massive MIMO or optical channels with single or multiple eavesdroppers. We include a numerical analysis of the secure goodput for a multi-mode fiber (MMF) optical channel to demonstrate the flexibility of our approach.
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.
We consider the optimal precoding design under power constraint for the Gaussian MIMO wiretap channel with a transmitter, a legitimate receiver, and an eavesdropper, each equipped with arbitrary number of antennas. The transmitter has access to full channel state information (CSI) of the legitimate link and eavesdropper link. Such an optimization problem is non-convex and an analytical optimal solution is difficult to obtain. In this paper, by resorting to the majorization theory, we develop a theoretical upper bound on the secrecy capacity which is proved useful in evaluating existing sub-optimal methods. Our analysis shows that, given that the number of antennas at the eavesdropper is no less than that of the transmitter, the generalized singular value decomposition (GSVD)-based method proposed in [1], albeit generally non-optimal, provides a near-optimal solution to the MIMO wiretap precoding design in the high signal-to-noise ratio (SNR) regime. Numerical results are provided to corroborate our theoretical results.
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.
In this paper, we investigate the problem of jointly designing optimum linear precoder and decoder with secrecy constraints, where two legitimate parties communicate in the presence of an eavesdropper over multiple-input multiple-output (MIMO) Gaussian channels. In particular, we focus on optimizing the linear transceiver to guarantee a certain quality of service (QoS) level for the legitimate receiver in terms of mean square error (MSE), whilst employing the artificial noise to maximally degrade the MSE for the eavesdropper. We assume that the transmitter may not or may have the channel state information (CSI) for the eavesdropper, and then propose two design formulations. With the aid of majorization theory, we characterize the forms of optimal transmit precoder when both the legitimate receiver and the eavesdropper employ the optimal linear MMSE receiver. Numerical results illustrate main conclusions.
We consider two fundamental multi-user channel models: the multiple-input multiple-output (MIMO) wiretap channel with one helper (WTH) and the MIMO multiple access wiretap (MAC-WT) channel. In each case, the eavesdropper has K antennas while the remaining terminals have N antennas each. We consider a fast fading channel where the channel state information (CSI) of the legitimate receiver is available at the transmitters but no CSI at the transmitters (CSIT) is available for the eavesdropper's channel. We determine the optimal sum secure degrees of freedom (s.d.o.f.) for each channel model for the regime K ≤ N, and show that in this regime, the MAC-WT channel reduces to the WTH in the absence of eavesdropper CSIT. For the regime N ≤ K ≤ 2N, we obtain the optimal linear s.d.o.f., and show that the MAC-WT channel and the WTH have the same optimal s.d.o.f. when restricted to linear encoding strategies. In the absence of any such restrictions, we provide an upper bound for the sum s.d.o.f. of the MAC-WT channel in the regime N ≤ K ≤ 2N. Our results show that unlike in the single-input single-output case, there is loss of s.d.o.f. for even the WTH due to lack of eavesdropper CSIT when K ≥ N.
This letter investigates robust secrecy rate optimization techniques for a multiple-input-multiple-output (MIMO) wiretap channel in the presence of a multiantenna eavesdropper. In particular, two robust secrecy rate optimization problems are studied: robust power minimization with an outage secrecy rate constraint and robust secrecy rate maximization subject to the outage secrecy rate and transmit power constraints. Here, it is assumed that the legitimate transmitter has perfect channel state information (CSI) of the legitimate receiver and imperfect CSI of the eavesdropper. Both robust problems are not convex in terms of transmit covariance matrix and the outage secrecy rate constraint. Hence, we propose a conservative approximation approach to reformulate this outage secrecy rate constraint by exploiting the Bernstein-type inequality to obtain a tractable solution for these two robust problems. Numerical results have been provided to validate the convergence and the performance of the proposed robust algorithms.