𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Logic Minimization Algorithms for VLSI Synthesis

✍ Scribed by Robert K. Brayton, Gary D. Hachtel, Curtis T. McMullen, Alberto L. Sangiovanni-Vincentelli (auth.)


Publisher
Springer US
Year
1984
Tongue
English
Leaves
203
Series
The Kluwer International Series in Engineering and Computer Science 2
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


The roots of the project which culminates with the writing of this book can be traced to the work on logic synthesis started in 1979 at the IBM Watson Research Center and at University of California, Berkeley. During the preliminary phases of these projects, the imporΒ­ tance of logic minimization for the synthesis of area and performance effective circuits clearly emerged. In 1980, Richard Newton stirred our interest by pointing out new heuristic algorithms for two-level logic minimization and the potential for improving upon existing approaches. In the summer of 1981, the authors organized and participated in a seminar on logic manipulation at IBM Research. One of the goals of the seminar was to study the literature on logic minimization and to look at heuristic algorithms from a fundamental and comparative point of view. The fruits of this investigation were surprisingly abundant: it was apparent from an initial implementation of recursive logic minimizaΒ­ tion (ESPRESSO-I) that, if we merged our new results into a two-level minimization program, an important step forward in automatic logic synthesis could result. ESPRESSO-II was born and an APL implemenΒ­ tation was created in the summer of 1982. The results of preliminary tests on a fairly large set of industrial examples were good enough to justify the publication of our algorithms. It is hoped that the strength and speed of our minimizer warrant its Italian name, which denotes both express delivery and a specially-brewed black coffee.

✦ Table of Contents


Front Matter....Pages i-xi
Introduction....Pages 1-14
Basic Definitions....Pages 15-28
Decomposition and Unate Functions....Pages 29-53
The Espresso-II Minimization Loop and Algorithms....Pages 54-138
Multiple-Valued Logic Minimization....Pages 139-147
Experimental Results....Pages 148-159
Comparisons and Conclusions....Pages 160-173
Back Matter....Pages 174-193

✦ Subjects


Computer-Aided Engineering (CAD, CAE) and Design;Computational Mathematics and Numerical Analysis;Electrical Engineering


πŸ“œ SIMILAR VOLUMES


Logic Minimization Algorithms for VLSI S
✍ Robert K. Brayton, Gary D. Hachtel, C. McMullen, Alberto L. Sangiovanni-Vincente πŸ“‚ Library πŸ“… 1984 πŸ› Springer 🌐 English

<span>The roots of the project which culminates with the writing of this book can be traced to the work on logic synthesis started in 1979 at the IBM Watson Research Center and at University of California, Berkeley. During the preliminary phases of these projects, the imporΒ­ tance of logic minimizat

Algorithms and Techniques for VLSI Layou
✍ Dwight Hill, Don Shugard, John Fishburn, Kurt Keutzer (auth.) πŸ“‚ Library πŸ“… 1988 πŸ› Springer US 🌐 English

<p>This book describes a system of VLSI layout tools called IDA which stands for "Integrated Design Aides. " It is not a main-line production CAD environment, but neither is it a paper tool. Rather, IDA is an experimental environment that serves to test out CAD ideas in the crucible of real chip des

Logic Synthesis for Low Power VLSI Desig
✍ Sasan Iman, Massoud Pedram (auth.) πŸ“‚ Library πŸ“… 1998 πŸ› Springer US 🌐 English

<p><em>Logic Synthesis for Low Power VLSI Designs</em> presents a systematic and comprehensive treatment of power modeling and optimization at the logic level. More precisely, this book provides a detailed presentation of methodologies, algorithms and CAD tools for power modeling, estimation and ana