About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Paper
Global Flow Optimization in Automatic Logic Design
Abstract
A new method for optimizing digital logic networks is described. Techniques of data flow analysis are used to summarize a circuit efficiently; this summary is used to characterize a class of circuits which are equivalent to the given circuit, and an algorithm is described which reduces the problem of finding small circuits in this equivalence class to the problem of finding a min-cut in an assoicated graph. This algorithm has been implemented and forms part of an automatic design system in use within IBM. We describe the results of experiments undertaken to evaluate the effect of our new techniques. © 1991 IEEE