By Topic

Direction finding in partly calibrated arrays composed of nonidentical subarrays: a computationally efficient algorithm for the rank reduction (RARE) estimator

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
$31 $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

4 Author(s)
Pesavento, M. ; Signal Theor. Group, Ruhr Univ., Bochum, Germany ; Gershman, A.B. ; Kon Max Wong ; Bohme, J.F.

We consider the direction finding problem in partly calibrated arrays composed of nonidentical subarrays which are displaced by unknown vector translations. A new computationally efficient algorithm is developed for the RAnk REduction (RARE) estimator

Published in:

Statistical Signal Processing, 2001. Proceedings of the 11th IEEE Signal Processing Workshop on

Date of Conference:

2001