The Community for Technology Leaders
Proceedings 21st International Conference on Computer Design (2003)
San Jose, California
Oct. 13, 2003 to Oct. 15, 2003
ISSN: 1063-6404
ISBN: 0-7695-2025-1
pp: 510
Samir Sapra , Carnegie Mellon University, Pittsburgh, PA
Michael Theobald , Carnegie Mellon University, Pittsburgh, PA
Edmund Clarke , Carnegie Mellon University, Pittsburgh, PA
ABSTRACT
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.
INDEX TERMS
null
CITATION

S. Sapra, M. Theobald and E. Clarke, "SAT-Based Algorithms for Logic Minimization," Proceedings 21st International Conference on Computer Design(ICCD), San Jose, California, 2003, pp. 510.
doi:10.1109/ICCD.2003.1240948
88 ms
(Ver 3.3 (11022016))