Performance-optimal behavioral synthesis with degenerable compound functional units

Since utilizing compound functional units (e.g., multiplier-accumulate) designed with shorter delay and/or smaller area than cascaded basic functional units is a well-known technique in system design, this paper presents an ILP-based approach for performance-driven behavioral synthesis with compound functional units. The algorithm maximizes the performance of a design under resource constraints by deriving all possible degenerative forms of compound functional units and by maximizing the utilization of resources. The proposed method exploits patterns acquired from available resource types to cover the target design optimally, and then guarantees that the synthesis result is with minimal latency. Experimental results show that our approach achieves significant performance improvement as compared with the prior art.

[1]  K. Keutzer DAGON: Technology Binding and Local Optimization by DAG Matching , 1987, 24th ACM/IEEE Design Automation Conference.

[2]  Miodrag Potkonjak,et al.  Performance optimization using template mapping for datapath-intensive high-level synthesis , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Peter Marwedel,et al.  Built-in chaining: introducing complex components into architectural synthesis , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[4]  Yusuke Matsunaga,et al.  An efficient performance improvement method utilizing specialized functional units in Behavioral Synthesis , 2008, 2008 Asia and South Pacific Design Automation Conference.

[5]  Alok Sharma,et al.  Empirical evaluation of some high-level synthesis scheduling heuristics , 1991, 28th ACM/IEEE Design Automation Conference.

[6]  Peter Marwedel,et al.  OSCAR: optimum simultaneous scheduling, allocation and resource binding based on integer programming , 1994, EURO-DAC '94.