The Springer International Series in Engineering and Computer Science

Logic Minimization Algorithms for VLSI Synthesis

Authors: Brayton, R.K., Hachtel, G.D., McMullen, C., Sangiovanni-Vincentelli, A.

Free Preview

Buy this book

eBook 101,14 €
price for Italia (gross)
  • ISBN 978-1-4613-2821-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 145,59 €
price for Italia (gross)
  • ISBN 978-0-89838-164-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover 124,79 €
price for Italia (gross)
  • ISBN 978-1-4612-9784-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Reviews

`In short, a quite remarkable realization in the field.' Zentrallblatt für Mathematik (1986)

Table of contents (7 chapters)

Table of contents (7 chapters)

Buy this book

eBook 101,14 €
price for Italia (gross)
  • ISBN 978-1-4613-2821-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 145,59 €
price for Italia (gross)
  • ISBN 978-0-89838-164-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover 124,79 €
price for Italia (gross)
  • ISBN 978-1-4612-9784-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Services for this Book

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Logic Minimization Algorithms for VLSI Synthesis
Authors
Series Title
The Springer International Series in Engineering and Computer Science
Series Volume
2
Copyright
1984
Publisher
Springer US
Copyright Holder
Kluwer Academic Publishers
eBook ISBN
978-1-4613-2821-6
DOI
10.1007/978-1-4613-2821-6
Hardcover ISBN
978-0-89838-164-1
Softcover ISBN
978-1-4612-9784-0
Series ISSN
0893-3405
Edition Number
1
Number of Pages
XII, 194
Topics