A Central Limit Theorem for the SINR at the LMMSE Estimator Output for Large Dimensional Signals

This paper is devoted to the performance study of the Linear Minimum Mean Squared Error estimator for multidimensional signals in the large dimension regime. Such an estimator is frequently encountered in wireless communications and in array processing, and the Signal to Interference and Noise Ratio (SINR) at its output is a popular performance index. The SINR can be modeled as a random quadratic form which can be studied with the help of large random matrix theory, if one assumes that the dimension of the received and transmitted signals go to infinity at the same pace. This paper considers the asymptotic behavior of the SINR for a wide class of multidimensional signal models that includes general multi-antenna as well as spread spectrum transmission models. The expression of the deterministic approximation of the SINR in the large dimension regime is recalled and the SINR fluctuations around this deterministic approximation are studied. These fluctuations are shown to converge in distribution to the Gaussian law in the large dimension regime, and their variance is shown to decrease as the inverse of the signal dimension

Spectral analysis of the Gram matrix of mixture models

This text is devoted to the asymptotic study of some spectral properties of the Gram matrix $W^{\sf T} W$ built upon a collection $w_1, \ldots, w_n\in \mathbb{R}^p$ of random vectors (the columns of $W$), as both the number $n$ of observations and the dimension $p$ of the observations tend to infinity and are of similar order of magnitude. The random vectors $w_1, \ldots, w_n$ are independent observations, each of them belonging to one of $k$ classes $\mathcal{C}_1,\ldots, \mathcal{C}_k$. The observations of each class $\mathcal{C}_a$ ($1\le a\le k$) are characterized by their distribution $\mathcal{N}(0, p^{-1}C_a)$, where $C_1, \ldots, C_k$ are some non negative definite $p\times p$ matrices. The cardinality $n_a$ of class $\mathcal{C}_a$ and the dimension $p$ of the observations are such that $\frac{n_a}{n}$ ($1\le a\le k$) and $\frac{p}{n}$ stay bounded away from $0$ and $+\infty$. We provide deterministic equivalents to the empirical spectral distribution of $W^{\sf T}W$ and to the matrix entries of its resolvent (as well as of the resolvent of $WW^{\sf T}$). These deterministic equivalents are defined thanks to the solutions of a fixed-point system. Besides, we prove that $W^{\sf T} W$ has asymptotically no eigenvalues outside the bulk of its spectrum, defined thanks to these deterministic equivalents. These results are directly used in our companion paper "Kernel spectral clustering of large dimensional data", which is devoted to the analysis of the spectral clustering algorithm in large dimensions. They also find applications in various other fields such as wireless communications where functionals of the aforementioned resolvents allow one to assess the communication performance across multi-user multi-antenna channels.Comment: 25 pages, 1 figure. The results of this paper are directly used in our companion paper "Kernel spectral clustering of large dimensional data", which is devoted to the analysis of the spectral clustering algorithm in large dimensions. To appear in ESAIM Probab. Statis

Statistical Inference in Large Antenna Arrays under Unknown Noise Pattern

In this article, a general information-plus-noise transmission model is assumed, the receiver end of which is composed of a large number of sensors and is unaware of the noise pattern. For this model, and under reasonable assumptions, a set of results is provided for the receiver to perform statistical eigen-inference on the information part. In particular, we introduce new methods for the detection, counting, and the power and subspace estimation of multiple sources composing the information part of the transmission. The theoretical performance of some of these techniques is also discussed. An exemplary application of these methods to array processing is then studied in greater detail, leading in particular to a novel MUSIC-like algorithm assuming unknown noise covariance.Comment: 25 pages, 5 figure

Joint Beamforming and Power Control in Coordinated Multicell: Max-Min Duality, Effective Network and Large System Transition

This paper studies joint beamforming and power control in a coordinated multicell downlink system that serves multiple users per cell to maximize the minimum weighted signal-to-interference-plus-noise ratio. The optimal solution and distributed algorithm with geometrically fast convergence rate are derived by employing the nonlinear Perron-Frobenius theory and the multicell network duality. The iterative algorithm, though operating in a distributed manner, still requires instantaneous power update within the coordinated cluster through the backhaul. The backhaul information exchange and message passing may become prohibitive with increasing number of transmit antennas and increasing number of users. In order to derive asymptotically optimal solution, random matrix theory is leveraged to design a distributed algorithm that only requires statistical information. The advantage of our approach is that there is no instantaneous power update through backhaul. Moreover, by using nonlinear Perron-Frobenius theory and random matrix theory, an effective primal network and an effective dual network are proposed to characterize and interpret the asymptotic solution.Comment: Some typos in the version publised in the IEEE Transactions on Wireless Communications are correcte

Linear Precoding Based on Polynomial Expansion: Large-Scale Multi-Cell MIMO Systems

Large-scale MIMO systems can yield a substantial improvement in spectral efficiency for future communication systems. Due to the finer spatial resolution achieved by a huge number of antennas at the base stations, these systems have shown to be robust to inter-user interference and the use of linear precoding is asymptotically optimal. However, most precoding schemes exhibit high computational complexity as the system dimensions increase. For example, the near-optimal RZF requires the inversion of a large matrix. This motivated our companion paper, where we proposed to solve the issue in single-cell multi-user systems by approximating the matrix inverse by a truncated polynomial expansion (TPE), where the polynomial coefficients are optimized to maximize the system performance. We have shown that the proposed TPE precoding with a small number of coefficients reaches almost the performance of RZF but never exceeds it. In a realistic multi-cell scenario involving large-scale multi-user MIMO systems, the optimization of RZF precoding has thus far not been feasible. This is mainly attributed to the high complexity of the scenario and the non-linear impact of the necessary regularizing parameters. On the other hand, the scalar weights in TPE precoding give hope for possible throughput optimization. Following the same methodology as in the companion paper, we exploit random matrix theory to derive a deterministic expression for the asymptotic SINR for each user. We also provide an optimization algorithm to approximate the weights that maximize the network-wide weighted max-min fairness. The optimization weights can be used to mimic the user throughput distribution of RZF precoding. Using simulations, we compare the network throughput of the TPE precoding with that of the suboptimal RZF scheme and show that our scheme can achieve higher throughput using a TPE order of only 3

A CLT for linear spectral statistics of large random information-plus-noise matrices

Consider a matrix ${\rm Y}_n= \frac{\sigma}{\sqrt{n}} {\rm X}_n +{\rm A}_n,$ where $\sigma>0$ and ${\rm X}_n=(x_{ij}^n)$ is a $N\times n$ randommatrix with i.i.d. real or complex standardized entries and ${\rm A}_n$ is a $N\times n$ deterministic matrix with bounded spectral norm.The fluctuations of the linear spectral statistics of the eigenvalues:$$\mathrm{Trace}\, f({\rm Y}_n {\rm Y}_n^*) = \sum_{i=1}^N f(\lambda_i),\quad (\lambda_i)\ \mathrm{eigenvalues\ of}\ {{\rm Y}}_n {{\rm Y}}_n^*,$$are shown to be gaussian, in the case where $f$ is a smooth function of class $C^3$ with bounded support, and in the regime where both dimensions of matrix ${{\rm Y}}_n$ go to infinity at the same pace.The CLT is expressed in terms of vanishing Lévy-Prohorov distance between the linear statistics' distribution and a centered Gaussian probability distribution, the variance of which depends upon $N$ and $n$ and may not converge

Gaussian fluctuations for linear spectral statistics of large random covariance matrices

Consider a $N\times n$ matrix $\Sigma_n=\frac{1}{\sqrt{n}}R_n^{1/2}X_n$, where $R_n$ is a nonnegative definite Hermitian matrix and $X_n$ is a random matrix with i.i.d. real or complex standardized entries. The fluctuations of the linear statistics of the eigenvalues $$\operatorname {Trace}f \bigl(\Sigma_n\Sigma_n^*\bigr)=\sum_{i=1}^Nf(\lambda_i),\qquad (\lambda_i)\ eigenvalues\ of\ \Sigma_n\Sigma_n^*,$$ are shown to be Gaussian, in the regime where both dimensions of matrix $\Sigma_n$ go to infinity at the same pace and in the case where $f$ is of class $C^3$, that is, has three continuous derivatives. The main improvements with respect to Bai and Silverstein's CLT [Ann. Probab. 32 (2004) 553-605] are twofold: First, we consider general entries with finite fourth moment, but whose fourth cumulant is nonnull, that is, whose fourth moment may differ from the moment of a (real or complex) Gaussian random variable. As a consequence, extra terms proportional to $\vert \mathcal{V}\vert ^2=\bigl|\mathbb{E}\bigl(X_{11}^n\bigr) ^2\bigr|^2$ and $\kappa=\mathbb{E}\bigl \vert X_{11}^n\bigr \vert ^4-\vert {\mathcal{V}}\vert ^2-2$ appear in the limiting variance and in the limiting bias, which not only depend on the spectrum of matrix $R_n$ but also on its eigenvectors. Second, we relax the analyticity assumption over $f$ by representing the linear statistics with the help of Helffer-Sj\"{o}strand's formula. The CLT is expressed in terms of vanishing L\'{e}vy-Prohorov distance between the linear statistics' distribution and a Gaussian probability distribution, the mean and the variance of which depend upon $N$ and $n$ and may not converge.Comment: Published at http://dx.doi.org/10.1214/15-AAP1135 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org