An efficient graph representation for arithmetic circuit verification

Binary Decision Diagrams have been successful forms to represent Boolean functions, and AssociativeMemories have been one of the most important models for pattern recognition, being the Alpha-Beta Associative Memories the best available model today. In this paper we propose the use of Binary Decision Diagrams to represent Alpha-Beta associative memories. By doing so, we will be able to merge two important and very active areas of contemporary scientific research, and improve on both models.

show abstract

Edge-valued decision diagrams for multiple-valued functions

Stanković

Astola

Proceedings. 34th International Symposium on Multiple-Valued Logic

View full text Add to dashboard Cite

In this paper, we provide a brief review of various decision diagrams (DDs) with attributed edges, and then we propose a method for construction of various edge-valued diagrams for multiple-valued logic functions. We consider construction of both edge-valued diagrams with the additive and the multiplicative attributes at the edges. We illustrate the application of related algorithms by constructing examples of decision diagrams for quaternary functions.

show abstract

An efficient graph representation for arithmetic circuit verification

Cited by 8 publications

References 29 publications

XML Framework for Various Types of Decision Diagrams for Discrete Functions

XML Framework for Various Types of Decision Diagrams for Discrete Functions

Using Binary Decision Diagrams to Efficiently Represent Alpha-Beta Associative Memories

Edge-valued decision diagrams for multiple-valued functions

Contact Info

Product

Resources

About