A combined hardware selection, resource sharing and clock optimization for pipelined data-path synthesis

Abstract

This paper presents a new approach for time constrained synthesis of pipelined data-paths. The method improves on previous work in the synthesis by being able to integrate clock optimization and resource sharing with functional pipelining and library mapping. Experiments on several benchmarks show that such formulation ensures efficient exploration of delay-area trade offs and results in circuit structure with a near optimal area under given throughput constraint.