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.
Related
Conference paper
In the driver's seat of BooleDozer
Conference paper
BDDMAP: a technology mapper based on a new covering algorithm
Conference paper