Abstract
A method for mapping DSP algorithms represented by unimodular loop nests into application specific structures is presented. The method consists in representing the reduced dependence graph of an algorithm in the multidimensional index space, and mapping this graph into a subspace of structure and subspace of events. Some restrictions, which constrain the reduced dependence graph, help to simplify the mapping process, and to get pipelined processing units. An example of synthesis of a IIR-filter structure illustrates the mapping process.