Restructuring binary decision diagrams based on functional equivalence

Author

Wang, Kuo Hua ; Hwang, Ting Ting ; Chen, Cheng

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Chiao Tung Univ., Hsin Chu, Taiwan

fYear

1993

fDate

22-25 Feb 1993

Firstpage

261

Lastpage

265

Abstract

A method to restructure binary decision diagrams (BDDs) from a given input ordering to any other ordering is proposed. This technique is based on the concept of functional equivalence and BBDs structure equivalence. A transpositional operator is developed to implement the transformation. It is shown that this transformation is used to find a good input variable ordering for BBDs a good input partition for communication complexity based multilevel logic synthesis. Experimental results are presented

Keywords

Boolean functions; communication complexity; equivalence classes; logic design; multivalued logic; Boolean functions; binary decision diagrams; communication complexity; functional equivalence; input partition; input variable ordering; multilevel logic synthesis; restructuring method; transpositional operator; Binary decision diagrams; Boolean functions; Complexity theory; Computer science; Data structures; Input variables; Logic; Network synthesis; Network topology; Relays;

fLanguage

English

Publisher

ieee

Conference_Titel

Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on

Conference_Location

Paris

Print_ISBN

0-8186-3410-3

Type

conf

DOI

10.1109/EDAC.1993.386466

Filename

386466