By Topic

Implementation of adaptive array algorithms

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

1 Author(s)
R. Schreiber ; Rensselaer Polytechnic Institute, Troy, NY

Some new, efficient, and numerically stable algorithms for the recursive solution of matrix problems arising in optimal beam-forming and direction finding are described and analyzed. The matrix problems considered are systems of linear equations and spectral decomposition. While recursive solution procedures based on the matrix inversion lemma may be unstable, ours are stable. Furthermore, these algorithms are extremely fast.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:34 ,  Issue: 5 )