Weighted Subspace Fitting using Subspace perturbation expansions

摘要

This paper presetns a new approach to deriving statistically optimal weights for weighted subspace fitting algorithms. The approach uses a formula cales a "subspace perturbation expansion," which shows hwo hte subspaces of a matrix chhange when the matrix elements are perturbed .The perturbation expansion is used to derive an optimal WSF algorithm for estimating directions of arrival in array signal processing.