loading...
Minimization of OPKFDDs Using Genetic Algorithms
Warsaw, Poland September 04-September 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DSD.2001.952120Euromicro Symposium on Digital System ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
M. Jung, Chonnam National University
G. Lee, Chonnam National University
S. Park, Hanyang University
R. Drechsler, Siemens, AG
Abstract: OPKFDDs (Ordered Pseudo-Kronecker Functional Decision Diagrams) are one of ordered-DDs (Decision Diagrams) in which each node can take one of three decomposition types: Shannon, positive Davio and negative Davio. OPKFDDs provide representations of Boolean functions with smaller number of nodes than other DDs. Since an appropriate decomposition type has to be chosen for each node, the size of the representation is decided by the selection of the decomposition type as well as the variable ordering of the diagram. To overcome the huge search space for an optimal solution, a genetic algorithm is proposed to generate OPKFDDs with the minimal number of nodes with experimental results.
Citation:
M. Jung, G. Lee, S. Park, R. Drechsler, "Minimization of OPKFDDs Using Genetic Algorithms," dsd, pp.0072, Euromicro Symposium on Digital Systems Design (DSD'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.