Title :
Beamspace iterative quadratic WSF for DOA estimation
Author_Institution :
Dept. of Electr. & Comput. Eng., Michigan Technol. Univ., Houghton, MI, USA
fDate :
6/1/2003 12:00:00 AM
Abstract :
This article presents a beamspace version of the class of polynomial parameterized weighted subspace fitting (WSF) methods, including the well-known methods iterative quadratic maximum likelihood and method of direction estimation, for direction-of-arrival estimation with a uniform linear array. The difficulty with beamspace operation is that the Vandermonde structure of the array manifold may not preserve during a beamspace transformation. We tackle this obstacle using discrete Fourier transform beams and derive a parameterized polynomial representation of the signal subspace in the beamspace dimension. The resulting beamspace iterative quadratic WSF algorithm is not only computationally attractive, but also enjoys improved resolution threshold over element-space estimation.
Keywords :
array signal processing; design for testability; direction-of-arrival estimation; iterative methods; matrix algebra; maximum likelihood estimation; DFT beams; DFT matrix beamformers; DOA estimation; Vandermonde structure; WSF; array manifold; beamspace dimension; beamspace iterative quadratic; beamspace iterative quadratic WSF algorithm; beamspace operation; beamspace transformation; direction-of-arrival estimation; discrete Fourier transform beams; element-space estimation; iterative quadratic maximum likelihood estimation; parameterized polynomial signal subspace representation; polynomial parameterized weighted subspace fitting; resolution threshold; uniform linear array; Direction of arrival estimation; Discrete Fourier transforms; Iterative algorithms; Iterative methods; Maximum likelihood estimation; Parameter estimation; Polynomials; Sensor arrays; Signal resolution; Vectors;
Journal_Title :
Signal Processing Letters, IEEE
DOI :
10.1109/LSP.2003.811745