With asynchronous circuit design becoming a powerful tool in the development of new
digital systems, circuit designers are expected to have asynchronous design skills and be …

This paper describes a new BDD-based logic optimization system, BDS. It is based on a
recently developed theory for BDD-based logic decomposition, which supports both …

Over the years, the fundamentals of VLSI technology have evolved to include a wide range
of topics and a broad range of practices. To encompass such a vast amount of knowledge …

We introduce SATIRE, a new satisfiability solver that is particular-ly suited to verification and
optimization problems in electronic de-sign automation. SATIRE builds on the most recent …

Pseudo-Boolean and cardinality constraints are a natural generalization of clauses. While a
clause expresses that at least one literal must be true, a cardinality constraint expresses that …

Randomizing polynomials allow representing a function f (x) by a low-degree randomized
mapping ̂ f (x, r) whose output distribution on an input x is a randomized encoding of f (x). It …

Design of modern digital hardware systems and of complex software systems is almost
always connected with parallelism. For example, execution of an object-oriented p-gram can …

The set covering problem and the minimum cost assignment problem (respectively known
as unate and binate covering problem) arise throughout the logic synthesis ow. This paper …

Synthesis of Finite State Machines: Functional Optimization is one of two monographs
devoted to the synthesis of Finite State Machines (FSMs). This volume addresses functional …

The extension of a given instruction-set with specialized instructions has become a common
technique used to speed up the execution of applications. By identifying computationally …