Decision diagrams for discrete functions: classification and unified interpretation

Stanković, Radomir S.; Sasao, Tsutomu

doi:10.1109/aspdac.1998.669518

Cited by 19 publications

(5 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many different decision diagrams have been defined for the purpose of compact representations of different classes of discrete functions, and the relationships among them have been investigated, see for instance [8] for a particular example of such discussions. For a classification of decision diagrams, we refer to [55,56]. The spectral interpretation provided a unified view to various essentially different decision diagrams [54,55].…”

Section: Decision Trees and Diagrams In Switching Theory And Logic Designmentioning

confidence: 99%

Decision diagrams: From a mathematical notion to engineering applications

2011

View full text Add to dashboard Cite

The paper presents a historical perspective to the theory of decision diagrams from the first definitions of the trees in mathematics related to the representations of discrete sets to the more recent definitions of different decision trees and related diagrams that are widely used in few areas of computing. Special attention has been paid to the relationships (similarities and differences) between Binary decision diagrams (BDD) and Structurally synthesized binary decision diagrams (SSBDD).

show abstract

Section: Decision Trees and Diagrams In Switching Theory And Logic Designmentioning

confidence: 99%

Decision diagrams: From a mathematical notion to engineering applications

2011

View full text Add to dashboard Cite

show abstract

“…Various classes of decision diagrams have been introduced for different classes of discrete functions [1], [15], [16], and [17]. In [19] Walsh decision diagrams have been demonstrated as an efficient method for representation of bent functions in GF (2).…”

Section: Introductionmentioning

confidence: 99%

Representation of Multiple-Valued Bent Functions Using Vilenkin-Chrestenson Decision Diagrams

Stanković

Astola

2011

2011 41st IEEE International Symposium on Multiple-Valued Logic

View full text Add to dashboard Cite

Bent functions are a class of discrete functions which exhibit the highest degree of nonlinearity. As such bent functions form an essential part of cryptographic systems. Original concept of bent functions defined in GF (2) can be extended to multiple-valued case. Multiple-valued bent functions are defined in therms of properties of their VilenkinChrestenson spectra. Decision diagrams are a method of compact representation of discrete functions. Special types of decision diagrams have been introduced for various types of discrete functions. In this paper we demonstrate how VilenkinChrestenson decision diagrams can be used for efficient representation of multiple-valued bent functions.

show abstract

“…To demonstrate the usefulness of the approach, examples from the area of spectral techniques are studied: Various DDs differ from BDDs and MDDs in the expansion rules used [16]. We consider these DDs as particular examples of Spectral Transform DDs (STDDs) [5].…”

Section: Introductionmentioning

confidence: 99%

Generic implementation of DD packages in MVL

Drechsler

Janković²,

Stanković³

1999

Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium

Self Cite

View full text Add to dashboard Cite

This paper presents a generic approach to implementation of Decision Diagrams (DDs) for representation and manipulation of Multi-ValuedLogic (MVL) functions. The core package is based on recursive synthesis operations, where the recursive step is given by a table look-up technique. This allows to simply exchange the decomposition type without reimplementation of the complete program. The approach can easily be used for prototyping of MVL DD packages. We investigate the problem from a theoretical point of view, i.e. several decompositions that can be realized using the technique are given. Experimental results are reported to demonstrate the efficiency of the approach.

show abstract

Decision diagrams for discrete functions: classification and unified interpretation

Cited by 19 publications

References 47 publications

Decision diagrams: From a mathematical notion to engineering applications

Decision diagrams: From a mathematical notion to engineering applications

Representation of Multiple-Valued Bent Functions Using Vilenkin-Chrestenson Decision Diagrams

Generic implementation of DD packages in MVL

Contact Info

Product

Resources

About