Advertisement

Advanced BDD Optimization

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

Table of contents

  1. Front Matter
    Pages i-x
  2. Pages 1-7
  3. Pages 9-43
  4. Pages 145-195
  5. Pages 211-212
  6. Back Matter
    Pages 213-222

About this book

Introduction

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.

Keywords

SystemC VLSI algorithms artificial intelligence automation computer-aided design (CAD) design development integrated circuit logic optimization stability static-induction transistor

Authors and affiliations

  • Rüdiger Ebendt
    • 1
  • Görschwin Fey
    • 1
  • Rolf Drechsler
    • 1
  1. 1.University of BremenGermany

Bibliographic information

  • DOI https://doi.org/10.1007/b107399
  • Copyright Information Springer 2005
  • Publisher Name Springer, Boston, MA
  • eBook Packages Engineering
  • Print ISBN 978-0-387-25453-1
  • Online ISBN 978-0-387-25454-8
  • Buy this book on publisher's site