By Topic

Formal derivation of a systolic array for recursive least squares estimation

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

4 Author(s)
I. K. Proudler ; Defense Res. Agency, Malvern, UK ; J. G. McWhirter ; M. Moonen ; G. Hekstra

A systolic array for recursive least squares estimation by inverse updates is derived by means of algorithmic engineering. The derivation of this systolic array is highly nontrivial due to the presence of data contra-flow and feedback loops in the underlying signal flow graph. This would normally prohibit pipelined processing. However, it is shown that suitable delays may be introduced into the signal flow graph by performing a simple algorithmic transformation which compensates for the interference of crossing data flows. The pipelined systolic array is then obtained by retiming the signal flow graph and applying the cut theorem

Published in:

IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing  (Volume:43 ,  Issue: 3 )