Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ICCD
2003
IEEE

favoriteEmaildiscussreport

177views Hardware» more ICCD 2003»

SAT-Based Algorithms for Logic Minimization

14 years 1 months ago

SAT-Based Algorithms for Logic Minimization

Download www.michaeltheobald.com

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 deﬁned in ESPRESSO-II, our SAT-based implementation is signiﬁcantly 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.

Samir Sapra, Michael Theobald, Edmund M. Clarke

Real-time Traffic

Hardware | ICCD 2003 | Overall Minimization Strategy | SAT-based Implementation | Two-level Logic Minimization |

claim paper

Related Content

» SAT based ATPG using fast justification and propagation in the implication graph

» HyAC A Hybrid Structural SAT Based ATPG for Crosstalk

» The Logic Behind Weighted CSP

» A DemandDriven Algorithm for Generating Minimal Models

» Fast heuristic and exact algorithms for twolevel hazardfree logic minimization

» Information Hiding in Finite State Machine

» OPTIMISTA state minimization of asynchronous FSMs for optimum output logic

» Efficient Exact TwoLevel HazardFree Logic Minimization

» Minimization of Permuted ReedMuller Trees for Cellular Logic

Post Info
More Details (n/a)

Added	16 Mar 2010
Updated	16 Mar 2010
Type	Conference
Year	2003
Where	ICCD
Authors	Samir Sapra, Michael Theobald, Edmund M. Clarke

Comments (0)