Linear Precoding for Finite-Alphabet Signaling Over MIMOME Wiretap Channels

Wu, Yongpeng; Xiao, Chengshan; Ding, Zhi; Gao, Xiqi; Jin, Shi

doi:10.1109/tvt.2012.2195339

Cited by 136 publications

(147 citation statements)

References 44 publications

Supporting

Mentioning

147

Contrasting

Order By: Relevance

“…In this regard, single-antenna wiretap channels with discrete inputs have been studied in [10] by assuming an AWGN channel to the legitimate receiver and a fast fading channel to the eavesdropper. The case of MIMO wiretap channels with discrete inputs under quasi-static fading conditions has been investigated in [11]- [13]. While Bashar et al [11] propose a GSVD-based precoding with the aid of the perfect channel state information (CSI) corresponding to both channels, the works in [12] and [13] propose AN-aided strategies for scenarios where the instantaneous CSI of the eavesdropper is not available at the transmitter.…”

Section: (Corresponding Author: Tolga M Duman)mentioning

confidence: 99%

“…The case of MIMO wiretap channels with discrete inputs under quasi-static fading conditions has been investigated in [11]- [13]. While Bashar et al [11] propose a GSVD-based precoding with the aid of the perfect channel state information (CSI) corresponding to both channels, the works in [12] and [13] propose AN-aided strategies for scenarios where the instantaneous CSI of the eavesdropper is not available at the transmitter. Bashar et al [12] employ naive beamforming along with AN injection while considering single-antenna receivers.…”

Section: (Corresponding Author: Tolga M Duman)mentioning

confidence: 99%

See 1 more Smart Citation

Joint Precoder and Artificial Noise Design for MIMO Wiretap Channels With Finite-Alphabet Inputs Based on the Cut-Off Rate

Aghdam

Duman

2017

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-We consider precoder and artificial noise (AN) design for multi-antenna wiretap channels under the finitealphabet input assumption. We assume that the transmitter has access to the channel coefficients of the legitimate receiver and knows the statistics of the eavesdropper's channel. Accordingly, we propose a secrecy rate maximization algorithm using a gradient descent-based optimization of the precoder matrix and an exhaustive search over the power levels allocated to the AN. We also propose algorithms to reduce the complexities of direct ergodic secrecy rate maximization by: 1) maximizing a cut-off rate-based approximation for the ergodic secrecy rate, simplifying the mutual information expression, which lacks a closedform and 2) diagonalizing the channels toward the legitimate receiver and the eavesdropper, which allows for employing a pergroup precoding-based technique. Our numerical results reveal that jointly optimizing the precoder and the AN outperforms the existing solutions in the literature, which rely on the precoder optimization only. We also demonstrate that the proposed low complexity alternatives result in a small loss in performance while offering a significant reduction in computational complexity.Index Terms-Physical layer security, finite-alphabet inputs, precoding, artificial noise, cut-off rate, MIMO communications.

show abstract

Section: (Corresponding Author: Tolga M Duman)mentioning

confidence: 99%

Section: (Corresponding Author: Tolga M Duman)mentioning

confidence: 99%

Joint Precoder and Artificial Noise Design for MIMO Wiretap Channels With Finite-Alphabet Inputs Based on the Cut-Off Rate

Aghdam

Duman

2017

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…For convenience, we have defined ǫ n = δ n + δ ′ n after (31). Inequality (32) is true because given h n , w → x n → y n , h n ,ĥ n forms a Markov chain, whereas (33) holds since givenĥ n , x n is independent of h n ,h n .…”

Section: Stepmentioning

confidence: 99%

On the Secrecy Capacity of the Wiretap Channel With Imperfect Main Channel Estimation

Rezki

Khisti

Alouini

2014

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-We study the secrecy capacity of fast fading channels under imperfect main channel (between the transmitter and the legitimate receiver) estimation at the transmitter. Lower and upper bounds on the ergodic secrecy capacity are derived for a class of independent identically distributed (i.i.d.) fading channels. The achievable rate follows from a standard wiretap code in which a simple on-off power control is employed along with a Gaussian input. The upper bound is obtained using an appropriate correlation scheme of the main and the eavesdropper channels, and is the best known upper bound so far. The upper and the lower bounds coincide with recently derived ones in case of perfect main CSI. Furthermore, the upper bound is tight in case of no main CSI, where the secrecy capacity is equal to zero. Asymptotic analysis at high and low signal-to-noise ratio (SNR) are also given. At high SNR, we show that the capacity is bounded by providing upper and lower bounds that depend on the channel estimation error. At low SNR, however, we prove that the secrecy capacity is asymptotically equal to the capacity of the main channel as if there were no secrecy constraint. Numerical results are provided for independent identically distributed (i.i.d.) Rayleigh fading channels.

show abstract

“…It has been shown that with finite-alphabet input, increasing the power beyond a maximum point is harmful as the secrecy rate curve dips continuously thereafter. In [12], design of optimum linear transmit precoding for maximum secrecy rate over MIMO wiretap channel with finite-alphabet input and with perfect eavesdropper CSI assumption has been investigated.…”

Section: Introductionmentioning

confidence: 99%

Power allocation in MIMO wiretap channel with statistical CSI and finite-alphabet input

Vishwakarma

Chockalingam

2014

2014 International Conference on Signal Processing and Communications (SPCOM)

View full text Add to dashboard Cite

Abstract-In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical knowledge of the eavesdroppers CSI are assumed. We first consider the MIMO wiretap channel with Gaussian input. Using Jensen's inequality, we transform the secrecy rate max-min optimization problem to a single maximization problem. We use generalized singular value decomposition and transform the problem to a concave maximization problem which maximizes the sum secrecy rate of scalar wiretap channels subject to linear constraints on the transmit covariance matrix. We then consider the MIMO wiretap channel with finite-alphabet input. We show that the transmit covariance matrix obtained for the case of Gaussian input, when used in the MIMO wiretap channel with finite-alphabet input, can lead to zero secrecy rate at high transmit powers. We then propose a power allocation scheme with an additional power constraint which alleviates this secrecy rate loss problem, and gives non-zero secrecy rates at high transmit powers.keywords: MIMO

show abstract

Linear Precoding for Finite-Alphabet Signaling Over MIMOME Wiretap Channels

Cited by 136 publications

References 44 publications

Joint Precoder and Artificial Noise Design for MIMO Wiretap Channels With Finite-Alphabet Inputs Based on the Cut-Off Rate

Joint Precoder and Artificial Noise Design for MIMO Wiretap Channels With Finite-Alphabet Inputs Based on the Cut-Off Rate

On the Secrecy Capacity of the Wiretap Channel With Imperfect Main Channel Estimation

Power allocation in MIMO wiretap channel with statistical CSI and finite-alphabet input

Contact Info

Product

Resources

About