Source code transformation to improve conditional hardware reuse

The computations of a system whose behavior varies depending on the value of some conditions may present a property called mutual exclusiveness. This property, responsible for the degree of conditional reuse achievable after a high-level synthesis (HLS) process, is intrinsic to the behavior. But sometimes it is only partially reflected in the actual description written by a designer, leading to worse implementations. Our algorithm explores in an efficient manner the real mutual exclusiveness of the behavior, independently of the description style. It performs a transformation of the input description that allows the HLS tools to obtain better circuits in terms of the area saving due to conditional reuse.

[1]  Apostolos A. Kountouris,et al.  Hierarchical conditional dependency graphs as a unifying design representation in the CODESIS high-level synthesis system , 2000, ISSS '00.

[2]  Jose Manuel Mendias,et al.  Execution condition analysis in high level synthesis: a unified approach , 2000, ISSS '00.

[3]  Ajoy K. Bose,et al.  Bridge: a versatile behavioral synthesis system , 1988, DAC '88.

[4]  Jian Li,et al.  An algorithm to determine mutually exclusive operations in behavioral descriptions , 1998, Proceedings Design, Automation and Test in Europe.

[5]  Taewhan Kim,et al.  A scheduling algorithm for conditional resource sharing , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[6]  Raul Camposano,et al.  Path-based scheduling for synthesis , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Kazutoshi Wakabayashi,et al.  A resource sharing and control synthesis method for conditional branches , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[8]  Daniel D. Gajski,et al.  Condition Graphs For High-quality Behavioral Synthesis , 1994, IEEE/ACM International Conference on Computer-Aided Design.