Mapping different node types of dependence graphs into the same processing element

This paper presents a method for mapping different computation nodes into the same complex processing element. The processing elements which use the minimal number of building blocks are derived automatically from the computations of the different nodes. Known design procedures for mapping algorithms onto array processors can be extended by this method to allow the mapping of dependence graphs with different types of nodes onto signal flow graphs with complex processing elements. The implementation of the presented approach in the CAD-tool DECOMP extends the automatic design of VLSI array processors.<
>