Some algorithms for eigensubspace estimation

Reddy, V. U. ; Mathew, G. ; Paulraj, A. (1995) Some algorithms for eigensubspace estimation Digital Signal Processing, 5 (2). pp. 97-115. ISSN 1051-2004

Full text not available from this repository.

Official URL:

Related URL:


An important tool in signal processing is the use of eigenvalue and singular value decompositions for extracting information from time-series/sensor array data. These tools are used in the so-called subspace methods that underlie solutions to the harmonic retrieval problem in time series and the directions-of-arrival (DOA) estimation problem in array processing. The subspace methods require the knowledge of eigenvectors of the underlying covariance matrix to estimate the parameters of interest. Eigenstructure estimation in signal processing has two important classes: (i) estimating the eigenstructure of the given covariance matrix and (ii) updating the eigenstructure estimates given the current estimate and new data. In this paper, we survey some algorithms for both these classes useful for harmonic retrieval and DOA estimation problems. We begin by surveying key results in the literature and then describe, in some detail, energy function minimization approaches that underlie a class of feedback neural networks. Our approaches estimate some or all of the eigenvectors corresponding to the repeated minimum eigenvalue and also multiple orthogonal eigenvectors corresponding to the ordered eigenvalues of the covariance matrix. Our presentation includes some supporting analysis and simulation results. We may point out here that eigensubspace estimation is a vast area and all aspects of this cannot be fully covered in a single paper.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:45200
Deposited On:25 Jun 2011 09:39
Last Modified:25 Jun 2011 09:39

Repository Staff Only: item control page