Presentation 1998/12/10
An Efficient Disjunctive Decomposition Algorithm and Its Application to Logic Synthesis
Yusuke Matsunaga,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Bertacco and Damiani proposed an efficient algorithm finding disjunctive decomposition using Binary Decision Diagrams. However, their algorithm is not complete and does not find all the decompositions. In this paper, we analyze the problem of Bertacco and Damiani's method, and propose an exact and efficient algorithm finding disjunctive decompositions. Experimental results show that our algorithm is comparable or more efficient than Bertacco and Damiani's algorithm and derives accurate decompositions.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) logic synthesis / functional decomposition / binary decision diagrams
Paper # VLD98-110,CPSY98-130
Date of Issue

Conference Information
Committee VLD
Conference Date 1998/12/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To VLSI Design Technologies (VLD)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Efficient Disjunctive Decomposition Algorithm and Its Application to Logic Synthesis
Sub Title (in English)
Keyword(1) logic synthesis
Keyword(2) functional decomposition
Keyword(3) binary decision diagrams
1st Author's Name Yusuke Matsunaga
1st Author's Affiliation Fujitsu Laboratories LTD.()
Date 1998/12/10
Paper # VLD98-110,CPSY98-130
Volume (vol) vol.98
Number (no) 446
Page pp.pp.-
#Pages 8
Date of Issue