Direction finding in partly calibrated sensor arrays composed of multiple subarrays

Authors:
M. Pesavento;A.B. Gershman;K.M. Wong
Affiliations:
Dept. of Electr. & Comput. Eng., McMaster Univ., Hamilton, Ont.;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
2002

Citing 0
Cited 9

Multidimensional rank reduction estimator for parametric MIMO channel models

EURASIP Journal on Applied Signal Processing
Multisource self-calibration for sensor arrays

IEEE Transactions on Signal Processing
Direction-of-arrival estimation for nonuniform sensor arrays: from manifold separation to Fourier domain MUSIC methods

IEEE Transactions on Signal Processing
One- and two-dimensional direction-of-arrival estimation: An overview of search-free techniques

Signal Processing
Robust adaptive beamforming in partly calibrated sparse sensor arrays

IEEE Transactions on Signal Processing
Improved MUSIC by exploiting both real and complex sources

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Fast communication: Calibration errors of uniform linear sensor arrays for DOA estimation: an analysis with SRP-PHAT

Signal Processing
Fast communication: L-shaped array-based elevation and azimuth direction finding in the presence of mutual coupling

Signal Processing
Joint DOD and DOA estimation of bistatic MIMO radar in the presence of unknown mutual coupling

Signal Processing

Quantified Score

Hi-index	35.69

Visualization

Abstract

We consider the direction-finding problem in partly calibrated arrays composed of several calibrated and identically oriented (but possibly nonidentical) subarrays that are displaced by unknown (and possibly time-varying) vector translations. A new search-free eigenstructure-based direction-finding approach is proposed for such class of sensor arrays. It is referred to as the rank-reduction (RARE) estimator and enjoys simple implementation that entails computing the eigendecomposition of the sample array covariance matrix and polynomial rooting. Closed-form expressions for the deterministic Cramer-Rao bounds (CRBs) on direction-of-arrival (DOA) estimation for the considered class of sensor arrays are derived. Comparison of these expressions with simulation results show that the finite-sample performance of RARE algorithms in both time-invariant and time-varying array cases is close to the corresponding bounds. Moreover, comparisons of the derived CRBs with the well-known bounds for the fully calibrated time-invariant array case help to discover several interesting properties of DOA estimation in partly calibrated and time-varying arrays.