Title
An Exact Optimization Method Using ZDDs for Linear Decomposition of Index Generation Functions
Abstract
This paper proposes an exact optimization method using zero-suppressed binary decision diagrams (ZDDs) for linear decomposition of index generation functions. The proposed method searches for an exact optimum solution by recursively dividing an index set of an index generation function. Since ZDDs can represent sets compactly and uniquely, they can also represent partitions of an index set compactly and uniquely. Thus, the proposed method can reuse partial solutions (partitions of an index set) efficiently by using ZDDs, and avoid redundant solution search. Experimental results using benchmark index generation functions show the effectiveness of ZDDs.
Year
DOI
Venue
2018
10.1109/ISMVL.2018.00033
2018 IEEE 48th International Symposium on Multiple-Valued Logic (ISMVL)
Keywords
Field
DocType
index generation functions,linear decomposition,zero suppressed binary decision diagrams,logic design,exact optimization method
Logic synthesis,Decision tree,Discrete mathematics,Division (mathematics),Reuse,Computer science,Index set,Binary decision diagram,Algorithm,Recursion
Conference
ISSN
ISBN
Citations 
0195-623X
978-1-5386-4465-2
1
PageRank 
References 
Authors
0.38
6
3
Name
Order
Citations
PageRank
Shinobu Nagayama121825.30
Tsutomu Sasao21083141.62
Jon T. Butler332142.77