Minimization of OPKFDDs using genetic algorithms

Author

Jung, M. ; Lee, G. ; Park, S. ; Drechsler, R.

Author_Institution

Dept. of Comput. Sci., Chonnam Nat. Univ., Kwangju, South Korea

fYear

2001

fDate

2001

Firstpage

72

Lastpage

78

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

Keywords

Boolean functions; binary decision diagrams; logic design; minimisation; Boolean functions; OPKFDDs minimisation; genetic algorithms; ordered pseudo-Kronecker functional decision diagrams; ordered-DDs; search space; Boolean functions; Computer science; Data structures; Design automation; Field programmable gate arrays; Genetic algorithms; Input variables; Logic design; Logic testing; Minimization methods;

fLanguage

English

Publisher

ieee

Conference_Titel

Digital Systems Design, 2001. Proceedings. Euromicro Symposium on

Conference_Location

Warsaw

Print_ISBN

0-7695-1239-9

Type

conf

DOI

10.1109/DSD.2001.952120

Filename

952120