Share Email Print

Proceedings Paper

Suboptimal Subspace-Fitting Methods For Multidimensional Signal Parameter Estimation
Author(s): A. L. Swindlehurst; R Roy; T. Kailath
Format Member Price Non-Member Price
PDF \$14.40 \$18.00
 GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

ESPRIT is a recently introduced algorithm for direction-of-arrival (DOA) and spectral estimation. Its principal advantage is that parameter estimates are obtained directly, without knowledge (and hence storage) of the parameter manifold and without computation or search of some spectral measure. This advantage is achieved by exploiting a certain invariance structure for the spatial or temporal signal samples; for example, in DOA estimation, it is assumed that the sensor array is composed of two identical subarrays separated by a known displacement vector. In many applications, arrays are constructed with invariances in more than one spatial direction. These arrays are typically sampled uniformly, so an additional invariance in time may also be present. In this paper, it is shown how to generalize the geometric concepts of ESPRIT to accommodate arrays with multidimensional invariance structure, and consequently to simultaneously estimate multiple parameters (e.g., azimuth, elevation, frequency, etc.) per source. The framework for this generalization is provided by the fact that ESPRIT is equivalent to a least-squares (LS) fit of the single invariance structure to a set of vectors which span the signal subspace (hence the term subspace-fitting). For ESPRIT , the TLS fit requires no constraints. In the multi-dimensional case, however, constraints must be applied in order to obtain an "optimal" solution. We will primarily be concerned with suboptimal methods which approximate the optimal solution. Suboptimal here refers to the fact that the constraints are satisfied by a two-stage procedure rather than simultaneously with the LS fit; i.e., an unconstrained fit is performed first, after which the solutions are "projected" in some sense back onto the constraints.

Paper Details

Date Published: 14 November 1989
PDF: 12 pages
Proc. SPIE 1152, Advanced Algorithms and Architectures for Signal Processing IV, (14 November 1989); doi: 10.1117/12.962277
Show Author Affiliations
A. L. Swindlehurst, Stanford University (United States)
R Roy, Stanford University (United States)
T. Kailath, Stanford University (United States)

Published in SPIE Proceedings Vol. 1152:
Advanced Algorithms and Architectures for Signal Processing IV
Franklin T. Luk, Editor(s)