BDS: a BDD-based logic optimization system

作者：Congguang Yang, Maciej Ciesielski · 发表于：IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 年份：2002 · DOI：10.1109/tcad.2002.1013899 · 被引用次数：185 · 研究领域：Formal Methods in Verification、VLSI and Analog Circuit Testing、Embedded Systems Design Techniques

This paper describes a novel logic decomposition theory and a practical logic synthesis system, BDS. It is based on a new binary decision diagrams (BDD) decomposition technique which supports all types of decomposition structures, including AND, OR, XOR, and complex MUX, both algebraic and Boolean. As a result, the method is very efficient in synthesizing both AND/OR and XOR-intensive functions. It also has a capability to handle very large circuits, as it employs the BDD decomposition in the partitioned Boolean network environment. The experimental results show that BDD-based logic decomposition is a promising alternative to the existing logic optimization approaches. In particular, it offers a superior runtime advantage over traditional logic synthesis systems.