Skip to main content
SpringerLink
Log in

Advanced BDD Optimization

  • Book
  • © 2005

Overview

Authors:
  1. Rüdiger Ebendt

    1. University of Bremen, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Görschwin Fey

    1. University of Bremen, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

  3. Rolf Drechsler

    1. University of Bremen, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • BDD and SAT are major concepts in VLSI CAD
  • New objective functions for design space exploration require new algorithms for BDD optimization
  • Latest trend: fusion of the concepts BDD and SAT
  • Major impulses come from Artificial Intelligence (AI)
  • Unifying view, transfers the latest theoretical insights into practical applications
  • Includes supplementary material: sn.pub/extras

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Front Matter

    Pages i-x
    Download chapter PDF

  2. Introduction

    Pages 1-7

  3. Preliminaries

    Pages 9-43

  4. Exact Node Minimization

    Pages 45-119

  5. Heuristic Node Minimization

    Pages 121-143

  6. Path Minimization

    Pages 145-195

  7. Relation between SAT and BDDS

    Pages 197-209

  8. Final Remarks

    Pages 211-212

  9. Back Matter

    Pages 213-222
    Download chapter PDF
Back to top

Keywords

About this book

VLSI CADhas greatly bene?ted from the use of reduced ordered Binary Decision Diagrams (BDDs) and the clausal representation as a problem of Boolean Satis?ability (SAT), e.g. in logic synthesis, ver- cation or design-for-testability. In recent practical applications, BDDs are optimized with respect to new objective functions for design space exploration. The latest trends show a growing number of proposals to fuse the concepts of BDD and SAT. This book gives a modern presentation of the established as well as of recent concepts. Latest results in BDD optimization are given, c- ering di?erent aspects of paths in BDDs and the use of e?cient lower bounds during optimization. The presented algorithms include Branch ? and Bound and the generic A -algorithm as e?cient techniques to - plore large search spaces. ? The A -algorithm originates from Arti?cial Intelligence (AI), and the EDA community has been unaware of this concept for a long time. Re- ? cently, the A -algorithm has been introduced as a new paradigm to explore design spaces in VLSI CAD. Besides AI search techniques, the book also discusses the relation to another ?eld of activity bordered to VLSI CAD and BDD optimization: the clausal representation as a SAT problem.

Authors and Affiliations

  • University of Bremen, Germany

    Rüdiger Ebendt, Görschwin Fey, Rolf Drechsler

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation