Springer, 2011. — 446 p.
The last few decades have seen a stupendous growth in the speed and complexity of VLSI integrated circuits. This growth has been enabled by a powerful set of electronic design automation (EDA) tools. The earliest EDA tools were two-level logic minimization and PLA folding tools. Subsequently, EDA tools were developed to address other aspects of the VLSI design flow (in addition to logic optimization) such as technology mapping, layout optimization, formal verification. However, research in logic synthesis and optimization continued to progress rapidly. Some of the research in logic synthesis tools saw broader application, to areas far removed from traditional EDA, and routinely continue to do so. While observing the recent developments and publications in logic synthesis and optimization, we felt that there was a need for a single resource which presents some recent significant developments in this area. This is how the idea of this edited monograph came about. We decided to cover some key papers in logic synthesis, optimization, and its applications, in an effort to provide an advanced practitioner a single reference source that covers the important papers in these areas over the last few years.
This monograph is organized into five sections, dealing with logic decomposition, Boolean satisfiability, Boolean matching, logic optimization, and applications of logic techniques to special design scenarios. Each of the chapters in any section is an expanded, archival version of the original paper by the chapter authors, with additional examples, results, and/or implementation details.
We dedicate this book to the area of logic synthesis and hope that it can stimulate new and exciting ideas which expand the contribution of logic synthesis to areas far beyond its traditional stronghold of VLSI integrated circuit design.
Part I Logic DecompositionLogic Synthesis by Signal-Driven Decomposition
Sequential Logic Synthesis Using Symbolic Bi-decomposition
Boolean Factoring and Decomposition of Logic Networks
Ashenhurst Decomposition Using SAT and Interpolation
Bi-decomposition Using SAT and Interpolation
Part II Boolean SatisfiabilityBoundary Points and Resolution
SAT Sweeping with Local Observability Don’t-Cares
A Fast Approximation Algorithm for MIN-ONE SAT and Its Application on MAX-SAT Solving
Algorithms for Maximum Satisfiability Using Unsatisfiable Cores
Part III Boolean MatchingSimulation and SAT-Based Boolean Matching for Large Boolean Networks
Logic Difference Optimization for Incremental Synthesis
Large-Scale Boolean Matching
Part IV Logic OptimizationAlgebraic Techniques to Enhance Common Sub-expression Extraction for Polynomial System Synthesis
Automated Logic Restructuring with aSPFDs
Extracting Functions from Boolean Relations Using SAT and Interpolation
A Robust Window-Based Multi-node Minimization Technique Using Boolean Relations
Part V Applications to Specialized Design ScenariosSynthesizing Combinational Logic to Generate Probabilities: Theories and Algorithms
Probabilistic Error Propagation in a Logic Circuit Using the Boolean Difference Calculus
Digital Logic Using Non-DC Signals
Improvements of Pausible Clocking Scheme for High-Throughput and High-Reliability GALS Systems Design