Logic Synthesis and Verification Algorithms
Hachtel, Gary D., Somenzi, Fabio
- 出版商: Springer
- 出版日期: 2013-03-18
- 售價: $4,110
- 貴賓價: 9.5 折 $3,905
- 語言: 英文
- 頁數: 564
- 裝訂: Quality Paper - also called trade paper
- ISBN: 1475770367
- ISBN-13: 9781475770360
-
相關分類:
Algorithms-data-structures
海外代購書籍(需單獨結帳)
買這商品的人也買了...
-
Fundamentals of Power Electronics, 2/e (Hardcover)$1,250$1,225 -
Fundamentals of Engineering Electromagnetics (An Adapted Version)$1,150$1,127 -
Deep Learning (Hardcover)$1,650$1,617 -
Learning TensorFlow: A Guide to Building Deep Learning Systems$1,834$1,737 -
$454實戰大數據 : MATLAB 數據挖掘詳解與實踐 -
Design of Reinforced Concrete, 10/e (Hardcover)$1,960$1,921 -
Practical Node-RED Programming: Learn powerful visual programming techniques and best practices for the web and IoT$1,300$1,235 -
A Practical Guide to Quantum Machine Learning and Quantum Optimisation: Hands-on Approach to Modern Quantum Algorithms (Paperback)$1,950$1,853
商品描述
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.
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.
