By Topic

A systolic array for recursive least squares computations

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)
M. Moonen ; ESAT, Katholieke Univ., Leuven, Belgium ; J. Vandewalle

A triangular processor array has been developed for implementing recursive-least-squares computations. The throughput is O(n 0), which means that data vectors are fed in at a rate that is independent of the problem size. The corresponding least-squares solutions then run out of the array at the same rate. The overall efficiency is roughly 67%. This array is believed to be the first to implement a complete RLS algorithm in a stable and efficient manner

Published in:

IEEE Transactions on Signal Processing  (Volume:41 ,  Issue: 2 )