Searcharxiv⌕ Search

arXiv subjects

Matthew R. McKay

Publications and source records attributed to Matthew R. McKay.

At least 37 records · Page 2Linked to original sources

Large Dimensional Analysis and Optimization of Robust Shrinkage Covariance Matrix Estimators

This article studies two regularized robust estimators of scatter matrices proposed (and proved to be well defined) in parallel in (Chen et al., 2011) and (Pascal et al., 2013), based on Tyler's robust M-estimator (Tyler, 1987) and on Ledoit and Wolf's shrinkage covariance matrix estimator (Ledoit and Wolf, 2004). These hybrid estimators have the advantage of conveying (i) robustness to outliers or impulsive samples and (ii) small sample size adequacy to the classical sample covariance matrix estimator. We consider here the case of i.i.d. elliptical zero mean samples in the regime where both sample and population sizes are large. We demonstrate that, under this setting, the estimators under study asymptotically behave similar to well-understood random matrix models. This characterization allows us to derive optimal shrinkage strategies to estimate the population scatter matrix, improving significantly upon the empirical shrinkage method proposed in (Chen et al., 2011).

math.PR↗

Tomlinson-Harashima Precoding for Multiuser MIMO Systems with Quantized CSI Feedback and User Scheduling

This paper studies the sum rate performance of a low complexity quantized CSI-based Tomlinson-Harashima (TH) precoding scheme for downlink multiuser MIMO tansmission, employing greedy user selection. The asymptotic distribution of the output signal to interference plus noise ratio of each selected user and the asymptotic sum rate as the number of users K grows large are derived by using extreme value theory. For fixed finite signal to noise ratios and a finite number of transmit antennas $n_T$, we prove that as K grows large, the proposed approach can achieve the optimal sum rate scaling of the MIMO broadcast channel. We also prove that, if we ignore the precoding loss, the average sum rate of this approach converges to the average sum capacity of the MIMO broadcast channel. Our results provide insights into the effect of multiuser interference caused by quantized CSI on the multiuser diversity gain.

cs.IT↗

Transmit Designs for the MIMO Broadcast Channel with Statistical CSI

We investigate the multiple-input multiple-output broadcast channel with statistical channel state information available at the transmitter. The so-called linear assignment operation is employed, and necessary conditions are derived for the optimal transmit design under general fading conditions. Based on this, we introduce an iterative algorithm to maximize the linear assignment weighted sum-rate by applying a gradient descent method. To reduce complexity, we derive an upper bound of the linear assignment achievable rate of each receiver, from which a simplified closed-form expression for a near-optimal linear assignment matrix is derived. This reveals an interesting construction analogous to that of dirty-paper coding. In light of this, a low complexity transmission scheme is provided. Numerical examples illustrate the significant performance of the proposed low complexity scheme.

cs.IT↗

Perturbed Laguerre Unitary Ensembles, Painlevé V and Information Theory

In this review, we investigate a key information-theoretic performance metric in multiple-antenna wireless communications, the so-called outage probability. This quantity may be expressed in terms of a moment generating function, for which we present two separate integral representations, one involving a particular $σ$-form of Painlevé V. We also present a representation involving a non-linear second order difference equation.

math-ph↗

Enhancing Secrecy with Multi-Antenna Transmission in Wireless Ad Hoc Networks

We study physical-layer security in wireless ad hoc networks and investigate two types of multi-antenna transmission schemes for providing secrecy enhancements. To establish secure transmission against malicious eavesdroppers, we consider the generation of artificial noise with either sectoring or beamforming. For both approaches, we provide a statistical characterization and tradeoff analysis of the outage performance of the legitimate communication and the eavesdropping links. We then investigate the networkwide secrecy throughput performance of both schemes in terms of the secrecy transmission capacity, and study the optimal power allocation between the information signal and the artificial noise. Our analysis indicates that, under transmit power optimization, the beamforming scheme outperforms the sectoring scheme, except for the case where the number of transmit antennas are sufficiently large. Our study also reveals some interesting differences between the optimal power allocation for the sectoring and beamforming schemes.

cs.IT↗

Random Matrix Models, Double-Time Painlevé Equations, and Wireless Relaying

This paper gives an in-depth study of a multiple-antenna wireless communication scenario in which a weak signal received at an intermediate relay station is amplified and then forwarded to the final destination. The key quantity determining system performance is the statistical properties of the signal-to-noise ratio (SNR) γ at the destination. Under certain assumptions on the encoding structure, recent work has characterized the SNR distribution through its moment generating function, in terms of a certain Hankel determinant generated via a deformed Laguerre weight. Here, we employ two different methods to describe the Hankel determinant. First, we make use of ladder operators satisfied by orthogonal polynomials to give an exact characterization in terms of a "double-time" Painlevé differential equation, which reduces to Painlevé V under certain limits. Second, we employ Dyson's Coulomb Fluid method to derive a closed form approximation for the Hankel determinant. The two characterizations are used to derive closed-form expressions for the cumulants of γ, and to compute performance quantities of engineering interest.

nlin.SI↗

Rethinking the Secrecy Outage Formulation: A Secure Transmission Design Perspective

This letter studies information-theoretic security without knowing the eavesdropper's channel fading state. We present an alternative secrecy outage formulation to measure the probability that message transmissions fail to achieve perfect secrecy. Using this formulation, we design two transmission schemes that satisfy the given security requirement while achieving good throughput performance.

cs.IT↗

On the Distribution of MIMO Mutual Information: An In-Depth Painlevé Based Characterization

This paper builds upon our recent work which computed the moment generating function of the MIMO mutual information exactly in terms of a Painlevé V differential equation. By exploiting this key analytical tool, we provide an in-depth characterization of the mutual information distribution for sufficiently large (but finite) antenna numbers. In particular, we derive systematic closed-form expansions for the high order cumulants. These results yield considerable new insight, such as providing a technical explanation as to why the well known Gaussian approximation is quite robust to large SNR for the case of unequal antenna arrays, whilst it deviates strongly for equal antenna arrays. In addition, by drawing upon our high order cumulant expansions, we employ the Edgeworth expansion technique to propose a refined Gaussian approximation which is shown to give a very accurate closed-form characterization of the mutual information distribution, both around the mean and for moderate deviations into the tails (where the Gaussian approximation fails remarkably). For stronger deviations where the Edgeworth expansion becomes unwieldy, we employ the saddle point method and asymptotic integration tools to establish new analytical characterizations which are shown to be very simple and accurate. Based on these results we also recover key well established properties of the tail distribution, including the diversity-multiplexing-tradeoff.

cs.IT↗

On the Design of Artificial-Noise-Aided Secure Multi-Antenna Transmission in Slow Fading Channels

In this paper, we investigate the design of artificial-noise-aided secure multi-antenna transmission in slow fading channels. The primary design concerns include the transmit power allocation and the rate parameters of the wiretap code. We consider two scenarios with different complexity levels: i) the design parameters are chosen to be fixed for all transmissions, ii) they are adaptively adjusted based on the instantaneous channel feedback from the intended receiver. In both scenarios, we provide explicit design solutions for achieving the maximal throughput subject to a secrecy constraint, given by a maximum allowable secrecy outage probability. We then derive accurate approximations for the maximal throughput in both scenarios in the high signal-to-noise ratio region, and give new insights into the additional power cost for achieving a higher security level, whilst maintaining a specified target throughput. In the end, the throughput gain of adaptive transmission over non-adaptive transmission is also quantified and analyzed.

cs.IT↗

Extreme Eigenvalue Distributions of Some Complex Correlated Non-Central Wishart and Gamma-Wishart Random Matrices

Let $\mathbf{W}$ be a correlated complex non-central Wishart matrix defined through $\mathbf{W}=\mathbf{X}^H\mathbf{X}$, where $\mathbf{X}$ is $n\times m \, (n\geq m)$ complex Gaussian with non-zero mean $\boldsymbolΥ$ and non-trivial covariance $\boldsymbolΣ$. We derive exact expressions for the cumulative distribution functions (c.d.f.s) of the extreme eigenvalues (i.e., maximum and minimum) of $\mathbf{W}$ for some particular cases. These results are quite simple, involving rapidly converging infinite series, and apply for the practically important case where $\boldsymbolΥ$ has rank one. We also derive analogous results for a certain class of gamma-Wishart random matrices, for which $\boldsymbolΥ^H\boldsymbolΥ$ follows a matrix-variate gamma distribution. The eigenvalue distributions in this paper have various applications to wireless communication systems, and arise in other fields such as econometrics, statistical physics, and multivariate statistics.

math.ST↗

Open-Loop Spatial Multiplexing and Diversity Communications in Ad Hoc Networks

This paper investigates the performance of open-loop multi-antenna point-to-point links in ad hoc networks with slotted ALOHA medium access control (MAC). We consider spatial multiplexing transmission with linear maximum ratio combining and zero forcing receivers, as well as orthogonal space time block coded transmission. New closed-form expressions are derived for the outage probability, throughput and transmission capacity. Our results demonstrate that both the best performing scheme and the optimum number of transmit antennas depend on different network parameters, such as the node intensity and the signal-to-interference-and-noise ratio operating value. We then compare the performance to a network consisting of single-antenna devices and an idealized fully centrally coordinated MAC. These results show that multi-antenna schemes with a simple decentralized slotted ALOHA MAC can outperform even idealized single-antenna networks in various practical scenarios.

cs.IT↗

Perturbed Hankel Determinants: Applications to the Information Theory of MIMO Wireless Communications

In this paper we compute two important information-theoretic quantities which arise in the application of multiple-input multiple-output (MIMO) antenna wireless communication systems: the distribution of the mutual information of multi-antenna Gaussian channels, and the Gallager random coding upper bound on the error probability achievable by finite-length channel codes. It turns out that the mathematical problem underpinning both quantities is the computation of certain Hankel determinants generated by deformed versions of classical weight functions. For single-user MIMO systems, it is a deformed Laguerre weight, whereas for multi-user MIMO systems it is a deformed Jacobi weight. We apply two different methods to characterize each of these Hankel determinants. First, we employ the ladder operators of the corresponding monic orthogonal polynomials to give an exact characterization of the Hankel determinants in terms of Painlevé differential equations. This turns out to be a Painlevé V for the single-user MIMO scenario and a Painlevé VI for the multi user scenario. We then employ Coulomb fluid methods to derive new closed-form approximations for the Hankel determinants which, although formally valid for large matrix dimensions, are shown to give accurate results for both the MIMO mutual information distribution and the error exponent even when the matrix dimensions are small. Focusing on the single-user mutual information distribution, we then employ both the exact Painlevé representation and the Coulomb fluid approximation to yield deeper insights into the scaling behavior in terms of the number of antennas and signal-to-noise ratio. Among other things, these results allow us to study the asymptotic Gaussianity of the distribution as the number of antennas increase, and to explicitly compute the correction terms to the mean, variance, and higher order cumulants.

cs.IT↗

Secure Transmission with Artificial Noise over Fading Channels: Achievable Rate and Optimal Power Allocation

We consider the problem of secure communication with multi-antenna transmission in fading channels. The transmitter simultaneously transmits an information bearing signal to the intended receiver and artificial noise to the eavesdroppers. We obtain an analytical closed-form expression of an achievable secrecy rate, and use it as the objective function to optimize the transmit power allocation between the information signal and the artificial noise. Our analytical and numerical results show that equal power allocation is a simple yet near optimal strategy for the case of non-colluding eavesdroppers. When the number of colluding eavesdroppers increases, more power should be used to generate the artificial noise. We also provide an upper bound on the signal-to-noise ratio (SNR) above which the achievable secrecy rate is positive and show that the bound is tight at low SNR. Furthermore, we consider the impact of imperfect channel state information (CSI) at both the transmitter and the receiver and find that it is wise to create more artificial noise to confuse the eavesdroppers than to increase the signal strength for the intended receiver if the CSI is not accurately obtained.

cs.IT↗

Eigen-Based Transceivers for the MIMO Broadcast Channel with Semi-Orthogonal User Selection

This paper studies the sum rate performance of two low complexity eigenmode-based transmission techniques for the MIMO broadcast channel, employing greedy semi-orthogonal user selection (SUS). The first approach, termed ZFDPC-SUS, is based on zero-forcing dirty paper coding; the second approach, termed ZFBF-SUS, is based on zero-forcing beamforming. We first employ new analytical methods to prove that as the number of users K grows large, the ZFDPC-SUS approach can achieve the optimal sum rate scaling of the MIMO broadcast channel. We also prove that the average sum rates of both techniques converge to the average sum capacity of the MIMO broadcast channel for large K. In addition to the asymptotic analysis, we investigate the sum rates achieved by ZFDPC-SUS and ZFBF-SUS for finite K, and show that ZFDPC-SUS has significant performance advantages. Our results also provide key insights into the benefit of multiple receive antennas, and the effect of the SUS algorithm. In particular, we show that whilst multiple receive antennas only improves the asymptotic sum rate scaling via the second-order behavior of the multi-user diversity gain; for finite K, the benefit can be very significant. We also show the interesting result that the semi-orthogonality constraint imposed by SUS, whilst facilitating a very low complexity user selection procedure, asymptotically does not reduce the multi-user diversity gain in either first (log K) or second-order (loglog K) terms.

cs.IT↗

Spatial multiplexing with MMSE receivers: Single-stream optimality in ad hoc networks

The performance of spatial multiplexing systems with linear minimum-mean-squared-error receivers is investigated in ad hoc networks. It is shown that single-stream transmission is preferable over multi-stream transmission, due to the weaker interference powers from the strongest interferers remaining after interference-cancelation. This result is obtained by new exact closed-form expressions we derive for the outage probability and transmission capacity.

cs.IT↗

Statistical Eigenmode Transmission over Jointly-Correlated MIMO Channels

We investigate MIMO eigenmode transmission using statistical channel state information at the transmitter. We consider a general jointly-correlated MIMO channel model, which does not require separable spatial correlations at the transmitter and receiver. For this model, we first derive a closed-form tight upper bound for the ergodic capacity, which reveals a simple and interesting relationship in terms of the matrix permanent of the eigenmode channel coupling matrix and embraces many existing results in the literature as special cases. Based on this closed-form and tractable upper bound expression, we then employ convex optimization techniques to develop low-complexity power allocation solutions involving only the channel statistics. Necessary and sufficient optimality conditions are derived, from which we develop an iterative water-filling algorithm with guaranteed convergence. Simulations demonstrate the tightness of the capacity upper bound and the near-optimal performance of the proposed low-complexity transmitter optimization approach.

cs.IT↗

Achievable Sum Rate of MIMO MMSE Recievers: A General Analytic Framework

This paper investigates the achievable sum rate of multiple-input multiple-output (MIMO) wireless systems employing linear minimum mean-squared error (MMSE) receivers. We present a new analytic framework which unveils an interesting connection between the achievable sum rate with MMSE receivers and the ergodic mutual information achieved with optimal receivers. This simple but powerful result enables the vast prior literature on ergodic MIMO mutual information to be directly applied to the analysis of MMSE receivers. The framework is particularized to various Rayleigh and Rician channel scenarios to yield new exact closed-form expressions for the achievable sum rate, as well as simplified expressions in the asymptotic regimes of high and low signal to noise ratios. These expressions lead to the discovery of key insights into the performance of MIMO MMSE receivers under practical channel conditions.

cs.IT↗

Maximum Sum-Rate of MIMO Multiuser Scheduling with Linear Receivers

We analyze scheduling algorithms for multiuser communication systems with users having multiple antennas and linear receivers. When there is no feedback of channel information, we consider a common round robin scheduling algorithm, and derive new exact and high signal-to-noise ratio (SNR) maximum sum-rate results for the maximum ratio combining (MRC) and minimum mean squared error (MMSE) receivers. We also present new analysis of MRC, zero forcing (ZF) and MMSE receivers in the low SNR regime. When there are limited feedback capabilities in the system, we consider a common practical scheduling scheme based on signal-to-interference-and-noise ratio (SINR) feedback at the transmitter. We derive new accurate approximations for the maximum sum-rate, for the cases of MRC, ZF and MMSE receivers. We also derive maximum sum-rate scaling laws, which reveal that the maximum sum-rate of all three linear receivers converge to the same value for a large number of users, but at different rates.

cs.IT↗