mostraligabue
» » Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications

ePub Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications download

by Thorsten Theobald,Christoph Meinel

ePub Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications download
Author:
Thorsten Theobald,Christoph Meinel
ISBN13:
978-3540644866
ISBN:
3540644865
Language:
Publisher:
Springer; 1998 edition (September 18, 1998)
Category:
Subcategory:
Engineering
ePub file:
1299 kb
Fb2 file:
1663 kb
Other formats:
mobi docx mbr lit
Rating:
4.5
Votes:
908

OBDD - Foundations and Applications. Authors: Meinel, Christoph, Theobald, Thorsten. New key results in theoretical computer science and in the design of data structures and efficient algorithms can be applied fruitfully here.

OBDD - Foundations and Applications. price for United Kingdom (gross).

Christoph Meinel, Thorsten Theobald. 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

Christoph Meinel, Thorsten Theobald. 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.

Author(s) Christoph Meinel and Thorsten Theobald.

Algorithms and Data Structures. . Complexity of Algorithms. Finite Automata and Finite State Machines.

oceedings{AD, title {Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications}, author {Christoph Meinel and Thorsten Theobald}, year {1998} }. Christoph Meinel, Thorsten Theobald. Propositions and Predicates. Algorithms and Data Structures. I. Data Structures for Switching Functions. 3. Boolean Functions. Boolean Formulas and Boolean Functions. Switching Functions.

Описание: Sahni's "Data Structures, Algorithms, and Applications in Java" is designed to be used in a second course in computer science (CS2).

The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation. Описание: Sahni's "Data Structures, Algorithms, and Applications in Java" is designed to be used in a second course in computer science (CS2).

Author: Christoph Meinel; Thorsten Theobald. Integrated circuits - Very large scale integration - Computer-aided design. Data structures (Computer science).

Christoph Meinel, Universität Trier Thorsten Theobald, Technische Universität München. Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications. Propositions and Predicates - . Sets, Relations, and Functions - . Graphs - . Algorithms and Data Structures - . Complexity of Algorithms - . Hashing - . Finite Automata and Finite State Machines - . References. Part I: Data Structures for Switching Functions.

Christoph Meinel (Author), Thorsten Theobald (Author). ISBN-13: 978-3540644866. Lists with This Book. This book is not yet featured on Listopia.

To get the free app, enter your mobile phone number.

One of the main problems in chip design is the enormous number of possible combinations of individual chip elements within a system, and the problem of their compatibility. The recent application of data structures, efficient algorithms, and ordered binary decision diagrams (OBDDs) has proven vital in designing the computer chips of tomorrow. This book provides an introduction to the foundations of this interdisciplinary research area, emphasizing its applications in computer aided circuit design.
  • Searching through the items I have purchased here at Amazon in the past I came upon a disturbing site: Someone had rated this book with 2 stars and claimed to be "interested in all aspects of algorithms and methods VLSI design automation". As you may see from below 13 out of 13 costumers ( I will be the 14th) seem to disagree or not find his comments all to helpful. I have rated this book with 5 starts in part to counteract this guy's horrible judgment and in part to make justice to a very well written book. At least that's what I thought after I first read it (during my sophomore year of college) after having finished an introduction course in Digital Design. What was nice about this book at the time was that it reinforced the basic concepts that my introductory course had left kind of hanging. This book is for the more mathematically inclined Computer Science or Electrical and Computer Engineering majors who want a more profound insight to digital design from small to large to very large integration. If you thought that just because it's a more theoretically oriented book it doesn't also provide good example you were of course wrong. There is a sizeable number of examples and best of all pseudo code of the algorithms which are explained here.

    I hope this ACTUALLY helps

  • Imagine that you have a many million transistor chip. No, imagine that you have a many billion transistor chip! And you want to prove that this chip does what it suppose to do. You cannot enumerate all the states of your chip and check that all is well, two to the power "a billion" is a pretty big number. The trick is then to iterate through the "higher levels" of a "compressed" form of the system to be validated, while being careful to keep the respresentation of the system compact. That is what ordered binary decision diagrams (OBDD) is all about and this book is a very good introduction to the subject.