Power Allocation in MIMO Wiretap Channel with Statistical CSI and Finite-Alphabet Input

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

Second-order coding rates for pure-loss bosonic channels

A pure-loss bosonic channel is a simple model for communication over free-space or fiber-optic links. More generally, phase-insensitive bosonic channels model other kinds of noise, such as thermalizing or amplifying processes. Recent work has established the classical capacity of all of these channels, and furthermore, it is now known that a strong converse theorem holds for the classical capacity of these channels under a particular photon number constraint. The goal of the present paper is to initiate the study of second-order coding rates for these channels, by beginning with the simplest one, the pure-loss bosonic channel. In a second-order analysis of communication, one fixes the tolerable error probability and seeks to understand the back-off from capacity for a sufficiently large yet finite number of channel uses. We find a lower bound on the maximum achievable code size for the pure-loss bosonic channel, in terms of the known expression for its capacity and a quantity called channel dispersion. We accomplish this by proving a general "one-shot" coding theorem for channels with classical inputs and pure-state quantum outputs which reside in a separable Hilbert space. The theorem leads to an optimal second-order characterization when the channel output is finite-dimensional, and it remains an open question to determine whether the characterization is optimal for the pure-loss bosonic channel.Comment: 18 pages, 3 figures; v3: final version accepted for publication in Quantum Information Processin

Performance of BPSK subcarrier intensity modulation free-space optical communications using a log-normal atmospheric turbulence model

In this paper, we present simulation results for the bit error rate (BER) performance and the fading penalty of a BPSK - subcarrier intensity modulation (BPSK-SIM) free-space optical (FSO) communication link in a log-normal atmospheric turbulence model. The results obtained are based on the Monte-Carlo simulation. Multiple subcarrier modulation schemes offer increased system throughput and require no knowledge of the channel fading in deciding what symbol has been received. In an atmospheric channel with a fading strength 2 l ? of 0.1 obtaining a BER of 10-6 using a 2-subcarrier system will require a signal-tonoise (SNR) of 23.1 dB. The required SNR increases with the fading strength and at a BER of 10-9 the fading penalty due to the atmospheric turbulence is ~ 41 dB for 9 . 0 2 = l ? . The comparative studies of the OOK and BPSK-SIM schemes showed that for similar electrical SNR, BPSK-SIM offered improved performance across all range of turbulence variance