Read Anywhere and on Any Device!

Subscribe to Read | $0.00

Join today and start reading your favorite books for Free!

Create Free Account

Quick and Easy Sign Up!

It takes less then 1 minute to sign up, then you can enjoy Unlimited eBooks.

Sign Up Browse

Popular Genres

Read Anywhere and on Any Device!

  • Download on iOS
  • Download on Android
  • Download on iOS

Advanced BDD Optimization

Advanced BDD Optimization

Rüdiger Ebendt
0/5 ( ratings)
Read Download
VLSI CADhas greatly bene?ted from the use of reduced ordered Binary Decision Diagrams and the clausal representation as a problem of Boolean Satis?ability , 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 , 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.
Language
English
Pages
222
Format
Hardcover
Publisher
Springer
Release
August 01, 2005
ISBN
0387254536
ISBN 13
9780387254531

Advanced BDD Optimization

Rüdiger Ebendt
0/5 ( ratings)
Read Download
VLSI CADhas greatly bene?ted from the use of reduced ordered Binary Decision Diagrams and the clausal representation as a problem of Boolean Satis?ability , 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 , 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.
Language
English
Pages
222
Format
Hardcover
Publisher
Springer
Release
August 01, 2005
ISBN
0387254536
ISBN 13
9780387254531

More books from Rüdiger Ebendt

Rate this book!

Write a review?

loader