Books > Professional & Technical > Energy technology & engineering > Electrical engineering
|
Buy Now
Advanced BDD Optimization (Paperback, Softcover reprint of hardcover 1st ed. 2005)
Loot Price: R4,425
Discovery Miles 44 250
|
|
Advanced BDD Optimization (Paperback, Softcover reprint of hardcover 1st ed. 2005)
Expected to ship within 10 - 15 working days
|
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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.