Mapping linear recurrences onto systolic arrays

Presents an automatic method for mapping a system of linear recurrence equations onto systolic architectures. First, we show that systolic architectures can be derived from linear recurrence equations using the notion of directed recurrence equations. Next, we provide a procedure called `cubization´ to achieve better performance while mapping such equations. The cubization procedure is completely automated and can be implemented to design systolic programs for a very general architecture referred to as the Basic Systolic Architecture (BSA). Using BSA, we obtain specific target architectures. The method is illustrated using a running example of Gauss-Jordan diagonalization