The application of compiler techniques in systolic array design
Uwe Vehlies, U. Seiler · 1991
The authors present a compiler which translates a DSP (digital signal processing) algorithm into a dependence graph suitable for systolic array design. The algorithm, any design constraints, and the external interfaces are described in Pascal and automatically translated into a run time protocol. From the run time protocol the data dependencies and node computations of the dependence graph are extracted. With this compiler most DSP algorithms can be translated into a fully expanded dependence graph. The resulting dependence graphs are as regular as the algorithms. The compiler supports the first step in the process of automatically mapping algorithms onto systolic array processors.>