Espresso-HF: A Heuristic Hazard-Free Minimizer for Two-Level Logic

-- We present a new heuristic algorithm for hazard-free minimization of two-level logic. On nearly all examples, the algorithm finds an exactly minimum-cost cover. It also solves several problems which have not been previously solved using existing exact minimizers. We believe this is the first heuristic method based on Espressoto solve the generalhazard-free two-level minimization problem, for multiple-input change transitions.

• Type: Conference
• Year: 1996
• Where: DAC
• Authors: Michael Theobald, Steven M. Nowick, Tao Wu
• Keywords: Computer Architecture, DAC 1996, Generalhazard-free Two-level Minimization, Hazard-free Minimization, Two-level Logic