Chih-Chun Lee

Learn More
Functional dependency is concerned with rewriting a Boolean function <i>f</i> as a function <i>h</i> over a set of base functions {<i>g</i><sub>1</sub>, ..., <i>g<sub>n</sub></i>}, i.e. <i>f</i> = <i>h(g</i><sub>1</sub>, ..., <i>g<sub>n</sub></i>). It plays an important role in many aspects of electronic design automation (EDA), ranging from logic synthesis(More)
—Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions It plays an important role in many aspects of electronic design automation (EDA). Prior approaches to the exploration of functional dependency are based on binary decision diagrams (BDDs), which may not be easily scalable to large designs.(More)
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in this paper, including: (1) a generic watching scheme on general gate types for efficient Boolean Constraint Propagation (BCP), (2) an implicit implication graph representation for(More)
  • 1