OPTIMIZING RESOURCE UTILIZATION USING TRANSFORMATIONS

The goal of the high level synthesis process for real time application s is to minimize the implementation cost, while still satisfying all t iming constraints. In this paper, we present how a combination of four conceptually simple, yet powerful, transformations: namely retiming, associativity, commutativity and inverse element law, can help to furt her this goal. Since the minimization problem associated with those tr ansformations is NP complete, a new fast iterative improvement probabi listic algorithm has been developed. The effectiveness of the proposed algorithm and the associated transformations is demonstrated in multi ple ways: using standard benchmark examples, with the aid of statistic al analysis and through a comparison with estimated minimal bounds.