Title :
New compact representation of multiple-valued functions, relations, and non-deterministic state machines
Author :
Grygiel, Stanislaw ; Perkowski, Marek
Author_Institution :
Dept. of Electr. Eng., Portland State Univ., OR, USA
Abstract :
In this paper we present a new data structure for representing multiple-valued relations (functions in particular) both completely and incompletely specified. The same format can be used for non-deterministic state machines (deterministic in particular). Relations are represented by labeled rough partitions, a structure similar to rough partitions, but storing the full information about relations and allowing for dynamic optimization of both memory requirements and processing time. We present experimental results from comparison of our data structure to Binary Decision Diagrams (BDDs) on binary functions (MCNC benchmarks) showing its superiority in terms of memory requirements in 73% cases. The new representation can be used to a large class of multiple-valued, completely and incompletely specified functions and relations, typical for Machine Learning (ML) and complex FSM controller optimization applications
Keywords :
binary decision diagrams; learning (artificial intelligence); minimisation of switching nets; multivalued logic; MCNC benchmarks; binary decision diagrams; binary functions; compact representation; data structure; labeled rough partitions; machine learning; memory requirements; multiple-valued functions; multiple-valued relations; nondeterministic state machines; processing time; relations; rough partitions; Artificial intelligence; Automatic control; Automatic logic units; Boolean functions; Data structures; Formal verification; Image coding; Image processing; Machine learning; Read only memory;
Conference_Titel :
Computer Design: VLSI in Computers and Processors, 1998. ICCD '98. Proceedings. International Conference on
Conference_Location :
Austin, TX
Print_ISBN :
0-8186-9099-2
DOI :
10.1109/ICCD.1998.727038
