On the Construction of Multiple-Valued Decision Diagrams

Authors:
D. Michael Miller;Rolf Drechsler
Affiliations:
-;-
Venue:
ISMVL '02 Proceedings of the 32nd International Symposium on Multiple-Valued Logic
Year:
2002

Citing 0
Cited 6

An efficient technique for synthesis and optimization of polynomials in GF(2m)

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields

IEEE Transactions on Computers
A Technique for Representing Multiple Output Binary Functions with Applications to Verification and Simulation

IEEE Transactions on Computers
A Top Down Interpreter for LPAD and CP-Logic

AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
XML Framework for Various Types of Decision Diagrams for Discrete Functions

IEICE - Transactions on Information and Systems
Interactive cost configuration over decision diagrams

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

Decision diagrams are the state-of-the-art representation for logic functions, both binary and multiple-valued. Here we consider ways to improve the construction of multiple-valued decisions 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.