POSITIVE-DEFINITE TOEPLITZ COMPLETION IN DOA ESTIMATION FOR NONUNIFORM LINEAR ANTENNA-ARRAYS - PART I - FULLY AUGMENTABLE ARRAYS

Citation
Yi. Abramovich et al., POSITIVE-DEFINITE TOEPLITZ COMPLETION IN DOA ESTIMATION FOR NONUNIFORM LINEAR ANTENNA-ARRAYS - PART I - FULLY AUGMENTABLE ARRAYS, IEEE transactions on signal processing, 46(9), 1998, pp. 2458-2471
Citations number
27
Categorie Soggetti
Engineering, Eletrical & Electronic
ISSN journal
1053587X
Volume
46
Issue
9
Year of publication
1998
Pages
2458 - 2471
Database
ISI
SICI code
1053-587X(1998)46:9<2458:PTCIDE>2.0.ZU;2-Q
Abstract
This paper considers the problem of direction-of-arrival (DOA) estimat ion for multiple uncorrelated plane waves incident on so-called ''full y augmentable'' sparse linear arrays, In situations where a decision i s made on the number of existing signal sources (m) prior to the estim ation stage, we investigate the conditions under which DOA estimation accuracy is effective (in the maximum-likelihood sense). In the case w here m is less than the number of antenna sensors (M), a new approach called ''MUSIC-maximum-entropy equalization'' is proposed to improve D OA estimation performance in the ''preasymptotic region'' of finite sa mple size (N) and signal-to-noise ratio. A full-sized positive definit e (p.d.) Toeplitx matrix is constructed from the M x M direct data cov ariance matrix, and then, alternating projections are applied to find a p.d. Toeplitz matrix with m-variate signal eigensubspace (''signal s ubspace truncation''). When m greater than or equal to M, Cramer-Rao b ound analysis suggests that the minimal useful sample size N is rather large, even for arbitrarily strong signals. It is demonstrated that t he well-known direct augmentation approach (DAA) cannot approach the a ccuracy of the corresponding Cramer-Rao bound, even asymptotically (as N --> infinity) and, therefore, needs to be improved. We present a ne w estimation method whereby signal subspace truncation of the DAA augm ented matrix is used for initialization and is followed by a local max imum-likelihood optimization routine. The accuracy of this method is d emonstrated to be asymptotically optimal for the various superior scen arios (m greater than or equal to M) presented.