On the construction of multiple-valued decision diagrams

Decision diagrams are the state-of-the-art representation for logic functions, both binary and multiple-valued. We consider ways to improve the construction of multiple-valued decision diagrams (MDD). Efficiency is achieved through the use of a simple computed table. We compare the use of recursive MIN and MAX as primitive operations in multiple-valued decision diagram construction to the MV-CASE primitive which is a generalization of the if-then-else (ITE) commonly used in binary DD packages. We also consider the use of cyclic negations and complements as MDD edge operations showing that for certain types of functions this approach can lead to significant reduction in MDD node count. They can also reduce the number of primitives that need to be explicitly implemented. Experimental results showing the efficiency of the proposed approaches are given. The direct implementation of MDDs is briefly compared to representing MDDs using a BDD package.

[1]  Robert K. Brayton,et al.  Algorithms for discrete function manipulation , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[2]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[3]  Chen-Shang Lin,et al.  On the OBDD-Representation of General Boolean Functions , 1992, IEEE Trans. Computers.

[4]  Rolf Drechsler,et al.  Ed&tc '97 on Cd-rom Fast and Ecient Construction of Bdds by Reordering Based Synthesis , 1997 .

[5]  Rolf Drechsler,et al.  Fast and Efficient Equivalence Checking based on NAND-BDDs , 2001 .

[6]  Rolf Drechsler,et al.  Implementing a multiple-valued decision diagram package , 1998, Proceedings. 1998 28th IEEE International Symposium on Multiple- Valued Logic (Cat. No.98CB36138).

[7]  D. Michael Miller.  Multiple-valued logic design tools , 1993, [1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic.

[8]  Rolf Drechsler,et al.  Binary decision diagrams in theory and practice , 2001, International Journal on Software Tools for Technology Transfer.

[9]  Tiziano Villa,et al.  VIS: A System for Verification and Synthesis , 1996, CAV.

[10]  Shin-ichi Minato,et al.  Graph-Based Representations of Discrete Functions , 1996 .

[11]  Fabio Somenzi,et al.  Efficient manipulation of decision diagrams , 2001, International Journal on Software Tools for Technology Transfer.

[12]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.

[13]  Rolf Drechsler,et al.  MORE: an alternative implementation of BDD packages by multi-operand synthesis , 1996, Proceedings EURO-DAC '96. European Design Automation Conference with EURO-VHDL '96 and Exhibition.

[14]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.