Bi-Decomposition of Multi-Valued Relations

Authors

Alan Mishchenko, Portland State UniversityFollow
Marek Perkowski, Portland State UniversityFollow
Bernd Steinbach, Freiberg University of Mining and Technology

Document Type

Presentation

Publication Date

6-2001

Subjects

Computer algorithms, Quantum computers, Decomposition (Mathematics)

Abstract

This presentation discusses an approach to decomposition of multivalued functions and relations into networks of two-input gates implementing multi-valued MIN and MAX operations. The algorithm exploits both the incompleteness of the initial specification and the flexibilities generated in the process of decomposition. Experimental results over a set of multi-valued benchmarks show that this approach outperforms other approaches in the quality of final results and CPU time.

Description

Originally presented to the 10th International Workshop on Logic & Synthesis, Granlibakken Conference Center, June 12-15, 2001.

Persistent Identifier

http://archives.pdx.edu/ds/psu/12773

Citation Details

Mishchenko, Alan, Bernd Steinbach, and Marek Perkowski. "Bi-decomposition of multi-valued relations." International Workshop on Logic and Synthesis. 2001.