Area Optimization of Multi-Cycle Operators in High-Level Synthesis

Conventional high-level synthesis algorithms usually employ multi-cycle operators to reduce the cycle length in order to improve the circuit performance. These operators need several cycles to execute one operation, but the entire functional unit is not used in any cycle. Additionally, the execution of operations over wider multi-cycle operators is unfeasible if their results must be available in a smaller number of cycles than the functional unit delay. This obliges to add new functional resources to the datapath even if multi-cycle operators are idle when the execution of the operation begins. In this paper a new design technique to overcome the restricted reusability of multi-cycle operators is presented. It reduces the area of these functional units allowing their internal reuse when executing one operation. It also expands the possibilities of common hardware sharing as it allows the partial use of multicycle operators to calculate narrower operations faster than the functional unit delay. This technique is applied as an optimization phase at the end of the high-level synthesis process, and can optimize the circuits synthesized by any high-level synthesis tool

[1]  Zhan Yu,et al.  The use of carry-save representation in joint module selection and retiming , 2000, DAC.

[2]  Román Hermida,et al.  Pre-synthesis Optimization of Multiplications to Improve Circuit Performance , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[3]  Kiyoung Choi,et al.  High-level synthesis under multi-cycle interconnect delay , 2001, ASP-DAC '01.

[4]  Kiyoung Choi,et al.  Performance-driven high-level synthesis with bit-level chaining andclock selection , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Nikil D. Dutt,et al.  Coordinated transformations for high-level synthesis of high performance microprocessor blocks , 2002, DAC '02.

[6]  Srivaths Ravi,et al.  Integrating variable-latency components into high-level synthesis , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Majid Sarrafzadeh,et al.  A scheduling algorithm for optimization and early planning in high-level synthesis , 2005, TODE.

[8]  Albert E. Casavant,et al.  Scheduling and hardware sharing in pipelined data paths , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[9]  Apostolos A. Kountouris,et al.  Efficient scheduling of conditional behaviors for high-level synthesis , 2002, TODE.

[10]  Alice C. Parker,et al.  Sehwa: a software package for synthesis of pipelines from behavioral specifications , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Jianwen Zhu,et al.  Soft scheduling in high level synthesis , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).