Converting sequential iterative algorithms to recurrent equations for automatic design of systolic arrays

The authors describe a procedure to transform a class of sequential iterative algorithms to systems of (uniform) recurrent equations (REs) from which systolic arrays can automatically be derived. They derive an equivalent class of systems of recurrent equations for a class of sequential iterative algorithms. First, they construct two formal models: A for the class of sequential algorithms they consider and R for the REs. Then they construct a procedure which maps an algorithm in A on a corresponding one in R. The essence of the method is to find the trace of the variables in the former algorithm. The method described is general and can be implemented in a design system for systolic arrays.>