Abstract
In this paper, we present an incremental synthesis procedure for a class of data path synthesis problems in which synthesis is carried out in a control step by control step fashion. The synthesis problems are classified according to the type of input dataflow graph (scheduled or unscheduled) and the type of storage units used (individual registers, single-port memory units, or multi-port memory units). These problems are solved optimally by employing either a network flow or 0---1 integer linear programming formulation. Experimental results on a number of benchmark problems are provided to demonstrate the effectiveness of the incremental synthesis algorithm.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
