Logic Minimization Algorithms for VLSI Synthesis
Brayton, Robert K.; Hachtel, Gary D.; McMullen, C.
ISBN 10: 0898381649 ISBN 13: 9780898381641
Published by Springer, 1984
Used
Hardcover
From
ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since 24 March 2009
This specific item is no longer available.
About this Item
Description:
Pages are clean and are not marred by notes or folds of any kind. ~ ThriftBooks: Read More, Spend Less 1.15. Seller Inventory # G0898381649I2N00
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.
Review:
`In short, a quite remarkable realization in the field.' Zentrallblatt für Mathematik (1986)
"About this title" may belong to another edition of this title.
Bibliographic Details
Title: Logic Minimization Algorithms for VLSI ...
Publisher: Springer
Publication Date: 1984
Binding: Hardcover
Condition: As New
Dust Jacket Condition: No Jacket
Top Search Results from the AbeBooks Marketplace
Stock Image
Logic Minimization Algorithms for VLSI Synthesis
Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.15. Seller Inventory # G0898381649I3N00
Quantity: 1 available
Stock Image
Logic Minimization Algorithms for VLSI Synthesis
Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less 1.15. Seller Inventory # G0898381649I5N00
Quantity: 1 available
Stock Image
Logic Minimization Algorithms for VLSI Synthesis (The Springer International Series in Engineering and Computer Science, 2)
Seller: Half Price Books Inc., Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_367758858
Quantity: 1 available
Stock Image
Logic Minimization Algorithms for VLSI Synthesis (The Springer International Series in Engineering and Computer Science, 2)
Seller: BennettBooksLtd, North Las Vegas, NV, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-0898381649
Quantity: 1 available
Stock Image
Logic Minimization Algorithms for VLSI Synthesis (The Springer International Series in Engineering and Computer Science, 2)
Seller: Toscana Books, AUSTIN, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Seller Inventory # Scanned0898381649
Quantity: 1 available
Seller Image
Logic Minimization Algorithms for VLSI Synthesis
Print on DemandSeller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. Seller Inventory # 5982363
Quantity: Over 20 available
Stock Image
Logic Minimization Algorithms for VLSI Synthesis (The Springer International Series in Engineering and Computer Science, 2)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar2317530031987
Quantity: Over 20 available
Stock Image
Logic Minimization Algorithms for VLSI Synthesis (The Springer International Series in Engineering and Computer Science, 2)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780898381641_new
Quantity: Over 20 available
Seller Image
Logic Minimization Algorithms for VLSI Synthesis
Published by
Springer US, Springer US Aug 1984, 1984
ISBN 10: 0898381649
ISBN 13: 9780898381641
New
Hardcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 210 pp. Englisch. Seller Inventory # 9780898381641
Quantity: 2 available
Seller Image
Logic Minimization Algorithms for VLSI Synthesis
Published by
Springer US, Springer US Aug 1984, 1984
ISBN 10: 0898381649
ISBN 13: 9780898381641
New
Hardcover
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 210 pp. Englisch. Seller Inventory # 9780898381641
Quantity: 2 available