Год издания: 2005
Количество страниц: 222
В продаже с 18.01.2012
Как только книга Advanced BDD Optimization станет доступна для заказа в одном из интернет-магазинов, Вам на e-mail будет отправлено уведомление.Укажите e-mail для связи:
VLSI CAD has greatly benefited from the use of reduced ordered Binary Decision Diagrams (BDDs) and the clausal representation as a problem of "Boolean Satisfiability" (SAT), e.g. in logic synthesis, verification 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. Advanced BDD Optimization gives a modern presentation of the established as well as of recent concepts. Latest results in BDD optimization are given, covering different aspects of paths in BDDs and the use of efficient lower bounds during optimization. The presented algorithms include Branch and Bound and the generic A*-algorithm as efficient techniques to explore large search spaces. The A*-algorithm originates from "Artificial Intelligence" (AI), and the EDA community has been unaware of this concept for a long time. Recently, the...