Minimization of Binary Decision Diagrams Based on Chaotic Differential Evolution Method
Zhongliang Pan · Journal of Hebei North University · 2010
The logic Boolean functions have wide applications in a lot of fields such as the design and test of digital circuits,computer science and artificial intelligence.The binary decision diagram(BDD) is an efficient representation approach of logic Boolean functions in which,the number of nodes is dependent on the variable ordering.A method based on chaotic differential evolution to minimize the binary decision diagrams is presented in this paper,in which the initial populations are produced by chaotic maps,and the better solutions are obtained by searching for the area around the approximate solutions gotten by differential evolution algorithm.Besides,an evolution scheme using double populations is designed to compute the variable ordering of BDD.The experimental results for the test pattern generation of some digital circuits show that the method proposed in this paper is able to get the better variable ordering,therefore the BDD with smaller scale can be obtained.