Advanced BDD optimization
Advanced BDD optimization
复制标题
高级 BDD 优化
DOI：
10.1007/b107399
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
R. Drechsler
中科院分区：
文献类型：
--
作者：
Rüdiger Ebendt;G. Fey;R. Drechsler
VLSI CAD 极大地受益于使用降序二元决策图(BDD) 和作为“布尔可满足性”(SAT) 问题的子句表示，例如在逻辑综合、验证或可测试性设计中。在最近的实际应用中，BDD 针对设计空间探索的新目标函数进行了优化。最新趋势显示，融合 BDD 和 SAT 概念的提案越来越多。高级 BDD 优化以现代方式展示了已建立的以及最新的概念。给出了 BDD 优化的最新结果，涵盖了 BDD 中路径的不同方面以及优化期间有效下界的使用。所提出的算法包括分支限界和通用 A* 算法，作为探索大型搜索空间的有效技术。 A*算法起源于“人工智能”（AI），而EDA界很长一段时间都没有意识到这个概念。最近，A* 算法作为一种新范例被引入，用于探索 VLSI CAD 中的设计空间。除了 AI 搜索技术之外，Advanved BDD Optimization 还讨论了与 VLSI CAD 和 BDD 优化相关的另一个活动领域的关系：作为 SAT 问题的子句表示。在BDD优化时，主要考虑图尺寸的最小化。本书是第一本针对 BDD 优化问题给出统一框架的书，并介绍了各自的最新方法。此外，还研究了BDD和SAT之间的关系，以回答最新发展中出现的问题。这包括从理论角度进行分析以及形式等效性检查中的实际示例。高级 BDD 优化通过将最新的理论见解转化为实际应用来缩小理论与实践之间的差距。在此，对理论进行了扎实、彻底的分析，并通过实验研究完成了分析。新优化目标的基本概念以及 BDD 和 SAT 两种范式之间的关系已经被人们了解和理解了很短的时间，它们将对该领域的进一步发展产生广泛的影响。
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), eg 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 A*-algorithm has been introduced as a new paradigm to explore design spaces in VLSI CAD. Besides AI search techniques, Advanved BDD Optimization also discusses the relation to another field of activity bordered to VLSI CAD and BDD optimization: the clausal representation as a SAT problem. When regarding BDD optimization, mainly the minimization of diagram size was considered. The present book is the first to give a unified framework for the problem of BDD optimization and it presents the respective recent approaches. Moreover, the relation between BDD and SAT is studied in response to the questions that have emerged from the latest developments. This includes an analysis from a theoretical point of view as well as practical examples in formal equivalence checking. Advanced BDD Optimization closes the gap between theory and practice by transferring the latest theoretical insights into practical applications. In this, a solid, thorough analysis of the theory is presented, which is completed by experimental studies. The basic concepts of new optimization goals and the relation between the two paradigms BDD and SAT have been known and understood for a short time, and they will have wide impact on further developments in the field.