Skip to search formSkip to main contentSkip to account menu

Unate function

Known as: Binate Function (Computing), Binate function 
A unate function is a type of boolean function which has monotonic properties.They have been studied extensively in switching theory. A function is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Exclusive orSwitching circuit theory

Broader (1)

Syntax (logic)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2001
2001
Unate Decomposition of Boolean Functions
We propose a new way of decomposing completely or incompletely specified Boolean functions into a set of unate functional blocks… 
2000
2000
Negative thinking in branch-and-bound: the case of unate covering
We introduce a new technique for solving some discrete optimization problems exactly. The motivation is that when searching the… 
1996
1996
Minimal delay test sets for unate gate networks
We consider delay testing of a specific class of logic circuits, the so called 'unate gate networks (UGNs)', which are of… 
1994
1994
Calculation of Unate Cube Set Algebra Using Zero-Suppressed BDDs
  • S. Minato
  • 31st Design Automation Conference
  • 1994
  • Corpus ID: 3346198
Many combinatorial problems in LSI design can be described with cube set expressions. We discuss unate cube set algebra based on… 
1988
1988
Functional Test Generation Based on Unate Function Theory
The generation of a universal test set (UTS) for unate functions is used as a starting point. This test set is complete and… 
Highly Cited
1984
Highly Cited
1984
Logic Minimization Algorithms for VLSI Synthesis
1. Introduction.- 1.1 Design Styles for VLSI Systems.- 1.2 Automatic Logic Synthesis.- 1.3 PLA Implementation.- 1.4 History of… 
1979
1979
On the Number of Fanout-Free Functions and Unate Cascade Functions
In this correspondence, the number of functions and the number of equivalence classes of functions realized by fanout-free… 
1972
1972
Generation of Representative Functions of the NPN Equivalence Classes of Unate Boolean Functions
  • C. Baugh
  • IEEE Transactions on Computers
  • 1972
  • Corpus ID: 45574051
An algorithm is described which generates the set of representative functions of the negation and/or permutation of variables and… 
Highly Cited
1971
Highly Cited
1971
Derivation of Minimum Test Sets for Unate Logical Circuits
  • R. Betancourt
  • IEEE Transactions on Computers
  • 1971
  • Corpus ID: 14475460
A derivation of test sets S<inf>0</inf>and S<inf>1</inf>for irredundant unate logical circuits is presented. It is shown that… 
Highly Cited
1961
Highly Cited
1961
Unate Truth Functions
This paper contains some applications of an elementary study of unate truth functions. One application is a method of deciding… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)