Library-adaptively integrated data path synthesis for DSP systems

A new algorithm for the integrated data path synthesis of high-performance DSP systems has been proposed. The integrated synthesis problem, that is the combined problem of module selection, scheduling, and allocation, is systematically formulated as a clique-partition problem of mixed-vertex compatibility graph on a module library and is solved simultaneously. We introduce a global cost function based on clique partition heuristic to evaluate each decision along the synthesis process. Salient features, such as library-adaptive and integrated processing (i.e., make all resources, including operators and interconnects, tradeoffs), are processed in the algorithm and experimental results are quite encouraged.<<ETX>>