Restructuring binary decision diagrams based on functionalequivalence

摘要

A method to restructure binary decision diagrams (BDDs) from angiven input ordering to any other ordering is proposed. This techniquenis based on the concept of functional equivalence and BBDs structurenequivalence. A transpositional operator is developed to implement thentransformation. It is shown that this transformation is used to find angood input variable ordering for BBDs a good input partition forncommunication complexity based multilevel logic synthesis. Experimentalnresults are presented