Share Email Print

Proceedings Paper

Generalized Minimum Norm And Constrained Total Least Squares With Applications To Array Signal Processing
Author(s): Michael D. Zoltowski
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The minimum norm Total Least Squares (TLS) solution to the linear system of equations AX = B for the case where the rank of the composite matrix [A I B] under no-noise/error-free conditions is strictly less than the number of columns in A is derived. The resulting method of solution is applied to the covariance level ESPRIT problem encountered in the field of sensor array signal processing. The TLS concept is targeted in light of the fact that the linear system of equations derived from ESPRIT at the covariance level is of the form AX = B where A and B are both in error. In contrast, conventional Least Squares only accounts for errors in B. The derivation is based on a projection operator interpretation of TLS1 analogous to the situation with conventional Least Squares in which the solution to AX = B is obtained by first projecting the columns of B onto range CA). The projection operator approach is further utilized to derive the constrained TLS solution when certain columns of A are known to be exact, i. e., free of error. The applicability of the constrained TLS solution for this case to the problem of estimating the source covariance matrix in a uniformly-spaced linear array scenario is discussed.

Paper Details

Date Published: 23 February 1988
PDF: 8 pages
Proc. SPIE 0975, Advanced Algorithms and Architectures for Signal Processing III, (23 February 1988); doi: 10.1117/12.948493
Show Author Affiliations
Michael D. Zoltowski, Purdue University (United States)

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

© SPIE. Terms of Use
Back to Top