Research indexJournal article
BDD-based two variable sharing extraction
Wu, Zhu
1 Jan 2005
NobleIDark:/48914/w1/20260515/1F0EFC87DOI10.1145/1120725.1120784
BDD-based two variable sharing extraction
Wu, Zhu · 2005 · Subscription
NobleIDark:/48914/w1/20260515/1F0EFC87DOI10.1145/1120725.1120784
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
It has been shown that Binary Decision Diagram (BDD) based logic synthesis enjoys faster runtime than the classic logic synthesis systems based on Sum of Product (SOP) form. However, its synthesis quality has not been on par with the classic method due to the lack of an effective sharing extraction strategy. In this paper, we present the first sharing extraction algorithm that directly exploits the structural properties of BDD. While our sharing extraction algorithm is limited to two-variable, disjunctive factors, and therefore may miss sharing opportunities, we show that it can be made exact, incremental and polynomial.