Logic Synthesis and Verification Algorithms

Fabio Somenzi

ISBN 10: 1475770367 / ISBN 13: 9781475770360

Published by Springer US, Springer New York, 2013

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9781475770360

Bibliographic Details

• Title: Logic Synthesis and Verification Algorithms
• Publisher: Springer US, Springer New York
• Publication Date: 2013
• Language: English
• ISBN 10: 1475770367
• ISBN 13: 9781475770360
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 254W x 178H x 33D millimeters 254 millimeters width by 178 millimeters height by 33 millimeters depth
• Weight: 1112 grams

About this title

Synopsis

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.