By Topic

Data flow representation of iterative algorithms for systolic arrays

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

2 Author(s)
Chein-Wei Jen, ; Inst. of Electron., Nat. Chiao-Tung Univ., Hsin-Chu, Taiwan ; Ding-Ming Kwai

An algebraic representation is proposed for regular iterative algorithms that can be described as bundles of data flows with different wavefronts. A form corresponding to a geometric representation such as a dependence graph is obtained by modeling data flows with a generating function of a power series. The main attributes of systolic algorithms and arrays are revealed by a unique dataflow representation. This provides the ability to pipeline two or more systolic arrays solving different subproblems without intermediate buffering. An example is given to show a case in which the technique can be used

Published in:

Computers, IEEE Transactions on  (Volume:41 ,  Issue: 3 )