SAT-Based Algorithms for Logic Minimization

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Samir Sapra Articles by Michael Theobald Articles by Edmund Clarke

2003 IEEE International Conference on Computer Design (ICCD'03)

San Jose, California

October 13-October 15

ISBN: 0-7695-2025-1

	ASCII Text	x
	Samir Sapra, Michael Theobald, Edmund Clarke, "SAT-Based Algorithms for Logic Minimization," Computer Design, International Conference on, pp. 510, 2003 IEEE International Conference on Computer Design (ICCD'03), 2003.

	BibTex	x
	@article{ 10.1109/ICCD.2003.1240948, author = {Samir Sapra and Michael Theobald and Edmund Clarke}, title = {SAT-Based Algorithms for Logic Minimization}, journal ={Computer Design, International Conference on}, volume = {0}, year = {2003}, issn = {1063-6404}, pages = {510}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICCD.2003.1240948}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer Design, International Conference on TI - SAT-Based Algorithms for Logic Minimization SN - 1063-6404 SP EP A1 - Samir Sapra, A1 - Michael Theobald, A1 - Edmund Clarke, PY - 2003 KW - null VL - 0 JA - Computer Design, International Conference on ER -

Samir Sapra, Carnegie Mellon University, Pittsburgh, PA

Michael Theobald, Carnegie Mellon University, Pittsburgh, PA

Edmund Clarke, Carnegie Mellon University, Pittsburgh, PA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCD.2003.1240948

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.