A graph theoretic technique for the generation of systolic implementations for shift-invariant flow graphs

This paper presents a general method for the transformation of algorithms described by shift-invariant fully-specified flow graphs into equivalent systolic realizations. The method consists of a set of rules for the systematic manipulation of the flow graphs into systolic form utilizing a set of theorems from graph theory. It is shown that many of the previously published systolic algorithms and many new algorithms can be generated using this single procedure.