Achievement And Optimization Of Un-quoting Domain BDD Package

Since the concept of the BDDs was devised by R.E.Bryant in 1986, as the concise and canonical tool, BDD broadly used in large scale integrated circuit and computer-aided design, such as logic functional verification test, synthesize, auto test program pattern generator , time sequencing and so on. The dissertation introduces the basic concept, advantages and development directions of BDD, summarize the design algorithm, advantages and behaviors of un-quoting domain BDD, also improve the structure's function. In addition, the dissertation analyze and summarize the core algorithms of the BDD, reveal the origin of the BDD's run efficiency, through the achievement of the un-recursion of APPLY algorithm, complete the optimization of BDD, experiment prove that the method is effective and executable.In the NP-complete problem that variable order of the BDD, there exist many algorithms. However, genetic algorithm has advantages and distinct point in solving compositional optimization problems. The dissertation introduces the minimize algorithm based on the genetic algorithm as the keystone, and assumes drawing sifting algorithm into it in order to accelerate the convergence rate of the function.