A fast minimization technique for subspace fitting with arbitrary array manifolds

Author

Pelin, Per

Author_Institution

SwitchCore AB, Goteborg, Sweden

Volume

49

Issue

12

fYear

2001

fDate

12/1/2001 12:00:00 AM

Firstpage

2935

Lastpage

2939

Abstract

A new technique for minimization of a multidimensional subspace fitting criterion is proposed. An approximation is made to the exact criterion function, giving an explicit least squares solution for location parameters. Ideas from alternating projections are employed for initialization. The new technique gives global convergence with a high probability, has a low computational cost, is applicable to general array manifolds, and provides simple solutions for many problems with intricate parameterization

Keywords

array signal processing; convergence of numerical methods; least squares approximations; minimisation; DOA estimation; alternating projections; approximation; array manifolds; global convergence; initialization; least squares solution; location parameters; low computational cost; minimization; multidimensional subspace fitting; probability; projection matrix; Array signal processing; Computational efficiency; Cost function; Gaussian processes; Least squares approximation; Maximum likelihood estimation; Minimization methods; Multidimensional signal processing; Multidimensional systems; Signal processing algorithms;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/78.969502

Filename

969502