Multi-Valued Logic Gates, Continuous Sensitivity, Reversibility, and Threshold Functions

نویسندگان

  • Asli Güçlükan Ilhan
  • Özgün Ünlü
چکیده

We define an invariant of a multi-valued logic gate by considering the number of certain threshold functions associated with the gate. We call this invariant the continuous sensitivity of the gate. We discuss a method for analysing continuous sensitivity of a multi-valued logic gate by using experimental data about the gate. In particular, we will show that this invariant provides a lower bound for the sensitivity of a boolean function considered as a multi-valued logic gate. We also discuss how continuous sensitivity can be used to understand the reversibility of the Fourier series expansion of a multi-valued logic gate.

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

ثبت نام

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

منابع مشابه

New full adders using multi-layer perceptron network

How to reconfigure a logic gate for a variety of functions is an interesting topic. In this paper, a different method of designing logic gates are proposed. Initially, due to the training ability of the multilayer perceptron neural network, it was used to create a new type of logic and full adder gates. In this method, the perceptron network was trained and then tested. This network was 100% ac...

متن کامل

Realization of Digital Fuzzy Operations Using Multi-Valued Fredkin Gates

Multi-valued Fredkin gates (MVFG) are reversible gates and they can be considered as modified version of the better known reversible gate the Fredkin gate. Reversible logic gates are circuits that have the same number of inputs and outputs and have one-to-one and onto mapping between vectors of inputs and outputs; thus the vector of input states can be always reconstructed from the vectors of o...

متن کامل

Synthesis of Quantum Multiple-Valued Circuits

An r-valued m-variable reversible logic function maps each of the rm input patters to a unique output pattern. The synthesis problem is to realize a reversible function by a cascade of primitive reversible gates. In this paper, we present a simple heuristic algorithm that exploits the bidirectional synthesis possibility inherent in the reversibility of the specification. The primitive reversibl...

متن کامل

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

متن کامل

Inversion complexity of functions of multi-valued logic

The minimum number of NOT gates in a logic circuit computing a Boolean function is called the inversion complexity of the function. In 1957, A. A. Markov determined the inversion complexity of every Boolean function and proved that ⌈log 2 (d(f)+ 1)⌉ NOT gates are necessary and sufficient to compute any Boolean function f (where d(f) is the maximum number of value changes from greater to smaller...

متن کامل

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


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

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

ثبت نام

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

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

دوره abs/1601.05988  شماره 

صفحات  -

تاریخ انتشار 2016