Advertisement

Algorithms and Data Structures in VLSI Design

OBDD — Foundations and Applications

  • Christoph Meinel
  • Thorsten Theobald

Table of contents

  1. Front Matter
    Pages I-XI
  2. Introduction

    1. Christoph Meinel, Thorsten Theobald
      Pages 1-6
  3. Basics

    1. Christoph Meinel, Thorsten Theobald
      Pages 7-22
  4. Data Structures for Switching Functions

    1. Front Matter
      Pages 23-23
    2. Christoph Meinel, Thorsten Theobald
      Pages 25-49
    3. Christoph Meinel, Thorsten Theobald
      Pages 51-76
    4. Christoph Meinel, Thorsten Theobald
      Pages 77-86
  5. OBDDs: An Efficient Data Structure

    1. Front Matter
      Pages 87-87
    2. Christoph Meinel, Thorsten Theobald
      Pages 89-103
    3. Christoph Meinel, Thorsten Theobald
      Pages 105-122
    4. Christoph Meinel, Thorsten Theobald
      Pages 123-144
    5. Christoph Meinel, Thorsten Theobald
      Pages 145-170
  6. Applications and Extensions

    1. Front Matter
      Pages 171-171
    2. Christoph Meinel, Thorsten Theobald
      Pages 173-197
    3. Christoph Meinel, Thorsten Theobald
      Pages 199-209
    4. Christoph Meinel, Thorsten Theobald
      Pages 211-234
    5. Christoph Meinel, Thorsten Theobald
      Pages 235-255
  7. Back Matter
    Pages 257-267

About this book

Introduction

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.

Keywords

Algorithms Automat Boolean function VLSI Variable algorithm ants automata complexity data structure data structures formal verification model checking optimization verification

Authors and affiliations

  • Christoph Meinel
    • 1
  • Thorsten Theobald
    • 2
  1. 1.University of TrierTrierGermany
  2. 2.Technical University MünchenMünchenGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-58940-9
  • Copyright Information Springer-Verlag Berlin Hiedelberg 1998
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-64486-6
  • Online ISBN 978-3-642-58940-9
  • Buy this book on publisher's site
Industry Sectors
Electronics
IT & Software
Telecommunications
Aerospace
Engineering