Bi-Decomposition of Multi-Valued Relations
Alan Mishchenko, Marek A. Perkowski, Bernd Steinbach · 2001
This paper 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 [5,6] in the quality of final results and CPU time.