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
ICCD 1991
Conference paper
Dual global flow
Abstract
We describe a new combinatorial logic optimization. The optimization is (in some sense) a dual of earlier global flow optimizations. The optimization leaves the function carried by each signal in the circuit unchanged and thus avoids expensive recomputation of 'don't care' information. We also describe the results of experiments performed to evaluate this optimization.