Algorithms and Data Structures in VLSI Design: OBDD โ Foundations and Applications
โ Scribed by Prof. Dr. Christoph Meinel, Dr. Thorsten Theobald (auth.)
- Publisher
- Springer-Verlag Berlin Heidelberg
- Year
- 1998
- Tongue
- English
- Leaves
- 270
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
One of the main problems in chip design is the huge number of possible combinations of individual chip elements, leading to a combinatorial explosion as chips become more complex. New key results in theoretical computer science and in the design of data structures and efficient algorithms can be applied fruitfully here. The application of ordered binary decision diagrams (OBDDs) has led to dramatic performance improvements in many computer-aided design projects. This textbook provides an introduction to the foundations of this interdisciplinary research area with an emphasis on applications in computer-aided circuit design and formal verification.
โฆ Table of Contents
Front Matter....Pages I-XI
Introduction....Pages 1-6
Basics....Pages 7-22
Front Matter....Pages 23-23
Boolean Functions....Pages 25-49
Classical Representations....Pages 51-76
Requirements on Data Structures in Formal Circuit Verification....Pages 77-86
Front Matter....Pages 87-87
OBDDs โ Ordered Binary Decision Diagrams....Pages 89-103
Efficient Implementation of OBDDs....Pages 105-122
Influence of the Variable Order on the Complexity of OBDDs....Pages 123-144
Optimizing the Variable Order....Pages 145-170
Front Matter....Pages 171-171
Analysis of Sequential Systems....Pages 173-197
Symbolic Model Checking....Pages 199-209
Variants and Extensions of OBDDs....Pages 211-234
Transformation Techniques for Optimization....Pages 235-255
Back Matter....Pages 257-267
โฆ Subjects
Processor Architectures; Algorithm Analysis and Problem Complexity; Computer Hardware
๐ SIMILAR VOLUMES
<p>This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algo
This text provides students with an introduction to data structures and algorithms. It emphasizes algorithm analysis and the development of efficient code, and includes important background material. Divided into three parts, the text features Data Structure Application sections at the end of each c
To truly understand how the Internet and Web are organized and function requires knowledge of mathematics and computation theory. Mathematical and Algorithmic Foundations of the Internet introduces the concepts and methods upon which computer networks rely and explores their applications to the Inte