Most approaches to control optimization use a finite state machine model, where operations are bound to conml states. However, when synthesizing circuits from a higher, more abstract level of hardware specification that supports concurrency and synchronization, these approaches may be overly restrictive. We present a strategy for optimizing control circuits based on resynchronization of operatiom such that the original specification under timing constraints is still satisfied. but with a lower control implementation cost. We use a general constraint graph model to capture the high level specification; the model supports unbounded delay operations. detailed timing constraints. and concurrency. We introduce the notion of synchronization redundancy. and formulate the optimization problem as the task of mapping operations to synchronization points. We present algorithms to find a minimal control cost implementation. Results of applying the technique within the framework of the HerculeslHebe High-level Synthesis system are presented.
[1]
Wayne Wolf,et al.
High-Level VLSI Synthesis
,
1991
.
[2]
Giovanni De Micheli,et al.
Relative scheduling under timing constraints
,
1991,
DAC '90.
[3]
Giovanni De Micheli,et al.
Optimal synthesis of control logic from behavioral specifications
,
1991,
Integr..
[4]
Robert K. Brayton,et al.
Retiming and Resynthesis: Optimizing Sequential Networks with
,
1990
.
[5]
A. Sangiovanni-Vincentelli,et al.
Retiming and resynthesis: optimizing sequential networks with combinational techniques
,
1990,
Twenty-Third Annual Hawaii International Conference on System Sciences.