pith. sign in

arxiv: 1406.5263 · v1 · pith:VSPFR4JGnew · submitted 2014-06-20 · 💻 cs.IT · math.IT

Bounds on Eigenvalues of a Spatial Correlation Matrix

classification 💻 cs.IT math.IT
keywords boundeigenvalueboundscorrelationmaximumspatialderiveeigenvalues
0
0 comments X
read the original abstract

It is critical to understand the properties of spatial correlation matrices in massive multiple-input multiple-output (MIMO) systems. We derive new bounds on the extreme eigenvalues of a spatial correlation matrix that is characterized by the exponential model in this paper. The new upper bound on the maximum eigenvalue is tighter than the previous known bound. Moreover, numerical studies show that our new lower bound on the maximum eigenvalue is close to the true maximum eigenvalue in most cases. We also derive an upper bound on the minimum eigenvalue that is also tight. These bounds can be exploited to analyze many wireless communication scenarios including uniform planar arrays, which are expected to be widely used for massive MIMO systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.