The capacity of a fixed Gaussian multiple-input multiple-output (MIMO) channel and the optimal transmission strategy under the total power (TP) constraint and full channel state information are well known. This problem remains open in the general case under individual per-antenna (PA) power constraints, while some special cases have been solved. These include a full-rank solution for the MIMO channel and a general solution for the multiple-input single-output (MISO) channel. In this paper, the fixed Gaussian MISO channel is considered and its capacity and optimal transmission strategies are determined in a closed form under the joint total and PA power constraints in the general case. In particular, the optimal strategy is hybrid and includes two parts: first is equal-gain transmission and second is maximum-ratio transmission, which are responsible for the PA and TP constraints, respectively. The optimal beamforming vector is given in a closed form and an accurate yet simple approximation to the capacity is proposed. Finally, the above results are extended to the MIMO case by establishing the ergodic capacity of fading MIMO channels under the joint power constraints when the fading distribution is right unitary-invariant (of which i.i.d. and semi-correlated Rayleigh fading are special cases). Unlike the fixed MISO case, the optimal signaling is shown to be isotropic in this case.
21 July 2015 in IEEE Transactions on Information Theory
Strong secrecy capacity of compound wiretap channels is studied. The known lower bounds for the secrecy capacity of compound finite-state memoryless channels under discrete alphabets are extended to arbitrary uncertainty sets and continuous alphabets under the strong secrecy criterion. The conditions under which these bounds are tight are given. Under the saddle-point condition, the compound secrecy capacity is shown to be equal to that of the worst-case channel. Based on this, the compound Gaussian multiple-input multiple-output wiretap channel is studied under the spectral norm constraint and without the degradedness assumption. First, it is assumed that only the eavesdropper channel is unknown, but is known to have a bounded spectral norm (maximum channel gain). The compound secrecy capacity is established in a closed form and the optimal signaling is identified. The compound capacity equals the worst-case channel capacity and thus establishing the saddlepoint property; the optimal signaling is Gaussian and on the eigenvectors of the legitimate channel and the worst-case eavesdropper is isotropic. The eigenmode power allocation somewhat resembles the standard water-filling but is not identical to it. More general uncertainty sets are considered and the existence of a maximum element is shown to be sufficient for a saddle-point to exist, so that signaling on the worst-case channel achieves the compound capacity of the whole class of channels. The case of rank-constrained eavesdropper is considered and the respective compound secrecy capacity is established. Subsequently, the case of additive uncertainty in the legitimate channel, in addition to the unknown eavesdropper channel, is studied. Its compound secrecy capacity and the optimal signaling are established in a closed form as well, revealing the same saddle-point property. When a saddle-point exists under strong secrecy, strong and weak secrecy compound capacities are equal.
This paper addresses the issue of the information content of a biometric image or system. We define biometric information as the decrease in uncertainty about the identity of a person due to a set of biometric measurements. We then show that the biometric information for a person may be calculated by the relative entropy D(pparq) between the population feature distribution q and the person's feature distribution p. The biometric information for a system is the mean D(pparq) for all persons in the population. In order to practically measure D(pparq) with limited data samples, we introduce an algorithm which regularizes a Gaussian model of the feature covariances. An example of this method is shown for PCA and ICA based face recognition, with biometric information calculated to be 45.0 bits (PCA), 39.0 bits (ICA) and 46.9 bits (fusion of PCA and ICA features). Finally, we discuss general applications of this measure
20 October 2016 in IEEE Transactions on Information Theory
Optimal signaling over the Gaussian multiple-input multiple-output wire-tap channel is studied under the total transmit power constraint. A closed-form solution for an optimal transmit covariance matrix is obtained when the channel is strictly degraded. In combination with the rank-1 solution, this provides the complete characterization of the optimal covariance for the case of two transmit antennas. The cases of weak eavesdropper and high SNR are considered. It is shown that the optimal covariance does not converge to a scaled identity in the high-SNR regime. Necessary optimality conditions and a tight upper bound on the rank of an optimal covariance matrix are established for the general case, along with a lower bound to the secrecy capacity, which is tight in a number of scenarios.
13 September 2010 in IEEE Transactions on Information Theory
Diversity-multiplexing tradeoff (DMT) was characterized asymptotically (SNR- > infinity) for i.i.d. Rayleigh fading channel by Zheng and Tse . The SNR-asymptotic DMT overestimates the finite-SNR one . This paper outlines a number of additional limitations and difficulties of the DMT framework and discusses their implications. Using the recent results on the size-asymptotic (in the number of antennas) outage capacity distribution, the finite-SNR, size-asymptotic DMT is derived for a broad class of fading distributions. The SNR range over which the finite-SNR DMT is accurately approximated by the SNR-asymptotic one is characterized. The multiplexing gain definition is shown to affect critically this range and thus should be carefully selected, so that the SNR-asymptotic DMT is an accurate approximation at realistic SNR values and thus has operational significance to be used as a design criterion. The finite-SNR diversity gain is shown to decrease with correlation and power imbalance in a broad class of fading channels, and such an effect is described in a compact, closed form. Complete characterization of the outage probability (or outage capacity) requires not only the finite-SNR DMT, but also the SNR offset, which is introduced and investigated as well. This offset, which is not accounted for in the DMT framework, is shown to have a significant impact on the outage probability for a broad class of fading channels, especially when the multiplexing gain is small. The analytical results and conclusions are validated via extensive Monte Carlo simulations. Overall, the size-asymptotic DMT represents a valuable alternative to the SNR-asymptotic one.
Keyhole MIMO channels were predicted theoretically and also observed experimentally. However, they are not often encountered in practice since the assumption of a single propagation eigenmode is only a rough approximation of real propagation environments. To overcome this problem, the paper extends the single-keyhole channel model by introducing a "multi-keyhole channel", which includes a number of statistically independent keyholes. Correlated full-rank and rank-deficient multi-keyhole channels are considered in detail. It is shown that under some general conditions the full-rank multi-keyhole channel is asymptotically Rayleigh fading, if the number of keyholes is large. When the number of both Tx and Rx antennas is large, the asymptotic capacity of a rank-deficient multi-keyhole channel is a sum of the capacities of the equivalent single-keyhole channels. The outage capacity distribution of both full-rank and rank-deficient multi-keyhole channels is asymptotically Gaussian. Based on the asymptotic capacity analysis, full ordering scalar measure of MIMO channel correlation and power imbalance is introduced