Abstract

In this article, we investigate the limiting spectral distribution of the sample covariance matrix (SCM) of weighted/windowed complex data. We use recent advances in random matrix theory and describe the distribution of eigenvalues of the doubly correlated Wishart matrices. We obtain an approximation for the spectral distribution of the SCM obtained from windowed data. We also determine a condition on the coefficients of the window, under which the fragmentation of the support of noise eigenvalues can be avoided, in the noise-only data case. For the commonly used exponential window, we derive an explicit expression for the l.s.d of the noise-only data. In addition, we present a method to identify the support of eigenvalues in the general case of signal-plus-noise. Simulations are performed to support our theoretical claims. The results of this article can be directly employed in many applications working with windowed array data such as source enumeration and subspace tracking algorithms.

Highlights

  • The distribution of the eigenvalues of the sample covariance matrix (SCM) of data has important impact on the performance of signal processing algorithms

  • The properties of complex Wishart matrices are used in the analysis and design of many signal processing algorithms such as in array processing

  • Our knowledge about the distribution of eigenvalues, eigenvectors and determinants of complex Wishart matrices and their limiting behavior is emerging as a key tool in a number of applications, e.g., in data compression and analysis of wireless MIMO channels [1,2], array processing, source enumeration and identification [3,4,5], adaptive algorithms [6,7]

Read more

Summary

Introduction

The distribution of the eigenvalues of the sample covariance matrix (SCM) of data has important impact on the performance of signal processing algorithms. In Theorem 3 we present a systematic method to compute the support of eigenvalues in the signal plus noise data case using an exponentially weighted window. In addition to the results, we follow up a different and novel approach in proving this theorem compared with the existing proof for the rectangular window case where the Stieltjes transform m(z) has the explicit inverse [15]. The array dimension and/or sample size are usually finite numbers, this method gives a deterministic approximation for the actual sample eigenvalue distribution To show how this method works, we consider the simplest case (where the distribution is well known) using a rectangular window and white Gaussian noise, i.e., W =.

Effective length of a window
Spectral analysis of noise-only data
Discrete distribution function approach
Continuous function approach
Spectral analysis of signal plus noise data
Support of eigenvalues
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call