By Topic

Eigenstructure-based algorithms for direction finding with time-varying arrays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Friedlander, Benjamin ; California Univ., Davis, CA, USA ; Zeira, A.

This paper considers the problem of finding the directions of narrowband signals using a time-varying array whose elements move during the observation interval in an arbitrary but known way. We derive two eigenstructure-based algorithms for this problem, which are modifications of techniques developed originally for time-invariant arrays. The first uses array interpolation, and the second uses focusing matrices. Like other eigenstructure-based methods, these algorithms require a modest amount of computations in comparison with the maximum likelihood (ML) estimator. The performance of the algorithms is evaluated by Monte-Carlo simulations, and is compared with the Cramer Rao Bound (CRB). Although both techniques were successful for wideband array processing with time-invariant arrays, we found that only the interpolated array algorithm is useful for direction finding (DF) with time-varying arrays.

Published in:

Aerospace and Electronic Systems, IEEE Transactions on  (Volume:32 ,  Issue: 2 )