Disjoint-support boolean decomposition combining functional and structural methods
2004 (English)In: Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC 2004, 2004, 597-599 p.Conference paper (Refereed)
This paper presents an algorithm for disjoint-support decomposition of Boolean functions which combines functional and structural approaches. First, a set of proper cut points is identified in the circuit by using dominator relations (structural method). Then, the circuit is partitioned along these cut points and a BDD-based decomposition is applied to the resulting smaller functions (functional method). Previous work on Boolean decomposition used only single methods and did not integrate a combined strategy. The experimental results show that the presented technique is more robust than a pure BDD-based approach and produces better-quality decompositions.
Place, publisher, year, edition, pages
2004. 597-599 p.
IdentifiersURN: urn:nbn:se:kth:diva-6858ISI: 000221356700133ScopusID: 2-s2.0-2442599137OAI: oai:DiVA.org:kth-6858DiVA: diva2:11682
Proceedings of the ASP - DAC 2004 Asia and South Pacific Design Automation Conference - 2004; Yokohama; Japan; 27 January 2004 through 30 January 2004;
Uppdaterad från manuskript till konferensbidrag: 20100909 QC 20100909 QC 201507102007-03-012007-03-012015-07-10Bibliographically approved