SAT-Based Algorithms for Logic Minimization

This paper introduces a new method for two-level logic minimization. Unlike previous approaches, the new method uses a SAT solver as an underlying engine. While the overall minimization strategy of the new method is based on the operators as defined in ESPRESSO-II, our SAT-based implementation is significantly different. The new minimizer SAT-ESPRESSO was found to perform 5–20 times faster than ESPRESSO-II and 3–5 times faster than BOOM on a set of large examples.

• Type: Conference
• Year: 2003
• Where: ICCD
• Authors: Samir Sapra, Michael Theobald, Edmund M. Clarke
• Keywords: Hardware, ICCD 2003, Overall Minimization Strategy, SAT-based Implementation, Two-level Logic Minimization