Optimization and Resynthesis of Complex Data-Paths

The problem of the optimization of complex data-paths relative to a repertoire of specified operations is discussed. Data-paths can be simplified if interconnections are functionally redundant. Redundancy is detected by means of the universal quantification of ROBDD representations of the data-path and of the specified operations. The full logical complexity of ALU´s described at the gate-level is considered. A 0-1 ILP formulation of the minimization problem is given and solved by means of ROBDD´s. A solution of the prelogic rectification problem for control-signals is presented.