Logic Synthesis and Verification Algorithms

Fabio Somenzi

ISBN 10: 1475770367 / ISBN 13: 9781475770360

Verlag: Springer US, Springer New York Mär 2013, 2013

Beschreibung

Neuware -Logic Synthesis and Verification Algorithms is a textbook designed for courses on VLSI Logic Synthesis and Verification, Design Automation, CAD and advanced level discrete mathematics. It also serves as a basic reference work in design automation for both professionals and students.Logic Synthesis and Verification Algorithms is about the theoretical underpinnings of VLSI (Very Large Scale Integrated Circuits). It combines and integrates modern developments in logic synthesis and formal verification with the more traditional matter of Switching and Finite Automata Theory. The book also provides background material on Boolean algebra and discrete mathematics.A unique feature of this text is the large collection of solved problems.Throughout the text the algorithms covered are the subject of one or more problems based on the use of available synthesis programs.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 600 pp. Englisch.

Bestandsnummer des Verkäufers 9781475770360

Bibliografische Details

• Titel: Logic Synthesis and Verification Algorithms
• Verlag: Springer US, Springer New York Mär 2013
• Erscheinungsjahr: 2013
• Sprache: Englisch
• ISBN-10: 1475770367
• ISBN-13: 9781475770360
• Einband: Taschenbuch
• Zustand: Neu
• Abmessungen: 254B x 178 H x 33 T Millimeter Breite: 254 mm, Höhe: 178 mm, Tiefe: 33 mm
• Gewicht: 1112 Gramm

Über diesen Titel

Inhaltsangabe

Logic Synthesis and Verification Algorithms is a textbook designed for courses on VLSI Logic Synthesis and Verification, Design Automation, CAD and advanced level discrete mathematics. It also serves as a basic reference work in design automation for both professionals and students.
Logic Synthesis and Verification Algorithms is about the theoretical underpinnings of VLSI (Very Large Scale Integrated Circuits). It combines and integrates modern developments in logic synthesis and formal verification with the more traditional matter of Switching and Finite Automata Theory. The book also provides background material on Boolean algebra and discrete mathematics.
A unique feature of this text is the large collection of solved problems.
Throughout the text the algorithms covered are the subject of one or more problems based on the use of available synthesis programs.