ESTIMATING IMPLEMENTATION BOUNDS FOR REAL-TIME DSP APPLICATION-SPECIFIC CIRCUITS

This paper discusses techniques for estimating implementation bounds o n computational resources and their role in the high-level synthesis p rocess. Accurate estimations can be extremely useful in a multitude of synthesis operations, such as algorithm and architecture selection, d esign space search, module selection, transformations, allocation, ass ignment, and scheduling. Several techniques to efficiently estimate sh arp minimum and maximum bounds on the resource requirements of a hardw are implementation are discussed. The performance of the algorithms as well as their applications is analyzed using an extensive benchmark s et. The proposed techniques have been implemented in the HYPER synthes is system.