loading...
SAT-Based Algorithms for Logic Minimization
San Jose, California October 13-October 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCD.2003.12409482003 IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Samir Sapra, Carnegie Mellon University, Pittsburgh, PA
Michael Theobald, Carnegie Mellon University, Pittsburgh, PA
Edmund Clarke, Carnegie Mellon University, Pittsburgh, PA
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.
Citation:
Samir Sapra, Michael Theobald, Edmund Clarke, "SAT-Based Algorithms for Logic Minimization," iccd, pp.510, 2003 IEEE International Conference on Computer Design (ICCD'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.