By Topic

Two-dimensional systolic array for the column-by-column QD algorithm

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 $33
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)
O. Brudaru ; Univ. 'Al.l.Cuza' Iasi, Romania ; G. M. Megson

A 2D systolic array for the column-by-column QD algorithm is presented. The design requires 4n+R+S-4 steps and (n-1)(2n+2R-1) processors to compute at least R iterations to the roots of S polynomials of degree less than or equal to n. A proof of correctness is given to verify the design and it is shown that the array is asymptotically optimal with respect to processor and bandwidth utilisation. Various extensions to the array are also discussed; in particular it is shown that a rectangular array of O(n2) processors (i.e. independent of R) can be used to produce an unlimited number of iterations.

Published in:

IEE Proceedings E - Computers and Digital Techniques  (Volume:138 ,  Issue: 6 )