International Journal of Innovative Research in Electrical, Electronics, Instrumentation and Control Engineering (IJIREEICE)
Binary Decision Diagrams (BDDs) are the most memory-efficient canonical data structure for Boolean functions known so far. The fact that the size of BDDs is highly sensitive to variable ordering has spurred a large body of research on heuristic variable ordering. Binary Decision Diagram (BDD) is an important data structure play a major role in reduction of nodes and computation time. In this paper, memetic algorithm with various crossover operators has been proposed for reduction of BDD node count and the execution time. The results have been compared using various crossover operators (namely ordered, partially mapped and cyclic) for multi-input adder benchmark circuits.