Decomposition of Multi-Valued Functions into Min- and Max-Gates

نویسندگان

  • Christian Lang
  • Bernd Steinbach
چکیده

This paper presents algorithms that allow the realization of multi-valued functions as a multi-level network consisting of minand max-gates. The algorithms are based on bi-decomposition of function intervals, a generalization of incompletely specified functions. Multi-valued derivation operators are applied to compute decomposition structures. For validation the algorithms have been implemented in the YADE system. Results of the decomposition of functions from machine learning applications are listed and compared to the results of another decomposer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bi-Decomposition of Multi-Valued Relations

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 o...

متن کامل

Decomposition of H*-Algebra Valued Negative Definite Functions on Topological *-Semigroups

In the present paper, among other results, a decomposition formula is given for the w-bounded continuous negative definite functions of a topological *-semigroup S with a weight function w into a proper H*-algebra A in terms of w-bounded continuous positive definite A-valued functions on S. A generalization of a well-known result of K. Harzallah is obtained. An earlier conjecture of the author ...

متن کامل

Multi-Valued Sub-Function Encoding in Functional Decomposition Based on Information Relationships Measures

Functional decomposition is becoming more and more popular, because it is more general than all other known logic synthesis approaches and it seems to be the most effective approach for LUT-based FPGAs, (C)PLDs and complex CMOS-gates. The multi-level functional decomposition can be seen as a recursive splitting of a given function, into two sub-functions: the predecessor (bound-set) function an...

متن کامل

Implementation of Multi-Valued Logic Gates Using Full Current-Mode CMOS Circuits

In this paper, a novel multi-valued logic gate set is designed by using only current-mode CMOS circuits. The gate set consists of min, max, inverter, literal, and cyclic operators based on a current-mode, versatile, novel threshold topology. They are shown to exhibit better static and dynamic behavior and consume less area compared to previous MVL design topologies and binary-logic counterparts...

متن کامل

A New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem

Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001