Central limit theorem for signal-to-interference ratio of reduced rank linear receiver

Let $\mathbf{s}_k=\frac{1}{\sqrt{N}}(v_{1k},...,v_{Nk})^T,$ with $\{v_{ik},i,k=1,...\}$ independent and identically distributed complex random variables. Write $\mathbf{S}_k=(\mathbf{s}_1,...,\mathbf {s}_{k-1},\mathbf{s}_{k+1},... ,\mathbf{s}_K),$ $\mathbf{P}_k=\operatorname {diag}(p_1,...,p_{k-1},p_{k+1},...,p_K)$, $\mathbf{R}_k=(\mathbf{S}_k\mathbf{P}_k\mathbf{S}_k^*+\sigma ^2\mathbf{I})$ and $\mathbf{A}_{km}=[\mathbf{s}_k,\mathbf{R}_k\mathbf{s}_k,... ,\mathbf{R}_k^{m-1}\mathbf{s}_k]$. Define $\beta_{km}=p_k\mathbf{s}_k^*\mathbf{A}_{km}(\mathbf {A}_{km}^*\times\ mathbf{R}_k\mathbf{A}_{km})^{-1}\mathbf{A}_{km}^*\mathbf{s}_k$, referred to as the signal-to-interference ratio (SIR) of user$k$under the multistage Wiener (MSW) receiver in a wireless communication system. It is proved that the output SIR under the MSW and the mutual information statistic under the matched filter (MF) are both asymptotic Gaussian when$N/K\to c>0$. Moreover, we provide a central limit theorem for linear spectral statistics of eigenvalues and eigenvectors of sample covariance matrices, which is a supplement of Theorem 2 in Bai, Miao and Pan [Ann. Probab. 35 (2007) 1532--1572]. And we also improve Theorem 1.1 in Bai and Silverstein [Ann. Probab. 32 (2004) 553--605].Comment: Published in at http://dx.doi.org/10.1214/07-AAP477 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Convergence of the largest eigenvalue of normalized sample covariance matrices when p and n both tend to infinity with their ratio converging to zero

Let $\mathbf{X}_p=(\mathbf{s}_1,...,\mathbf{s}_n)=(X_{ij})_{p \times n}$ where $X_{ij}$'s are independent and identically distributed (i.i.d.) random variables with $EX_{11}=0,EX_{11}^2=1$ and $EX_{11}^4<\infty$. It is showed that the largest eigenvalue of the random matrix $\mathbf{A}_p=\frac{1}{2\sqrt{np}}(\mathbf{X}_p\mathbf{X}_p^{\prime}-n\mathbf{I}_p)$ tends to 1 almost surely as $p\rightarrow\infty,n\rightarrow\infty$ with $p/n\rightarrow0$.Comment: Published in at http://dx.doi.org/10.3150/11-BEJ381 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statistical Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm

Simple and Nearly Optimal Polynomial Root-finding by Means of Root Radii Approximation

We propose a new simple but nearly optimal algorithm for the approximation of all sufficiently well isolated complex roots and root clusters of a univariate polynomial. Quite typically the known root-finders at first compute some crude but reasonably good approximations to well-conditioned roots (that is, those isolated from the other roots) and then refine the approximations very fast, by using Boolean time which is nearly optimal, up to a polylogarithmic factor. By combining and extending some old root-finding techniques, the geometry of the complex plane, and randomized parametrization, we accelerate the initial stage of obtaining crude to all well-conditioned simple and multiple roots as well as isolated root clusters. Our algorithm performs this stage at a Boolean cost dominated by the nearly optimal cost of subsequent refinement of these approximations, which we can perform concurrently, with minimum processor communication and synchronization. Our techniques are quite simple and elementary; their power and application range may increase in their combination with the known efficient root-finding methods.Comment: 12 pages, 1 figur