Minimum True and

Maximum false verti-

ces method for Real-
ization of threshod
gate

Minimum True and Maximum false ver-

tices method for Realization of
threshod gate Compare bit by bit and determine
which is greater
Cascade Realization

0 0 0 Steps involved are :

0 0 1 Greater
* Determine the
1 0 1 positive function.
1 1 1 Greater

10 0 0 * Determine Minimum True vertices.

0 1 1 1 We cannot compare
0 1 1 1
1 0 0 0 We cannot compare
* Anything greater than these areTrue
vertices.
* Remaining are all False vertices.
 f = x1 x2 + x3 x4
* Determine maximal x1 x 2 x3 x4
false vertices. 0 0 0 0
0 0 0 1
0 0 1 0
* Anything less than 0 0 1 1 True (Minimum)
false are neglected 0 1 0 0
or crossed. 0 1 0 1 False
0 1 1 0 False
0 1 1 1 True
* Others which are not compared are 1 0 0 0
1 0 0 1 False
false. 1 0 1 0 False
1 0 1 1 True
1 1 0 0 True (MInimum)
* For false we start from bottom to top. 1 1 0 1 True
1 1 1 0 True
1 1 1 1 True

f = x1 x2 x3 + x2 x3 x4 x1 x2 x3 x4
0 0 0 0
0 0 0 1
* Determine positive 0 0 1 0
function 0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0 False
f = x1 x2 x3 + x2 x3 x4 0 1 1 1 True (Minimum)
1 0 0 0
1 0 0 1 f = x1 x2 x3 + x2 x3 x4
* Find all Minimum True and Maximal 1 0 1 0
False vertices. 1 0 1 1 False
1 1 0 0
1 1 0 1 False
1 1 1 0 True (Minimum)
Two Minimum true p = Number of Mini-
vertices mum True vertices

0 1 1 1 q = Number of Maxi-
1 1 1 0 mum False vertices

Three Maximal False vertices * For each pair of vertices A ( a1, a2,...,
an) and B ( b1, b2, ..., bn) where a and b
1 1 0 1 are respectively Min. True and Max.
1 0 1 1 False vertices, write the inequality
0 1 1 0 a1 w1 + a2 w2 +...+ an wn > b1 w1 + b2 w2
+...+ bn wn

In our example w3>w4 w2>w1

p=2 w2>w4 w2>w1
q=3 w1>0 w4>0
We find six inequali-
w1 = w4 = 1
ties as follows:
w2 = w3 = 2
Substitute as Minimum True vertices
w1 + w2 + w3 > w1 + w2 + w4
w1 + w2 + w3 > w1 + w3 + w4 1 2 2 1
w1 + w2 + w3 > w2 + w3 w1 w2 w3 w4
w2 + w3 + w4 > w1 + w2 + w4 1 1 1 0 =5
w2 + w3 + w4 > w1 + w3 + w4 0 1 1 1 =5
w2 + w3 + w4 > w2 + w3
w1 = w4 = 1 T must be smaller
w2 = w3 = 2 than 5 but larger than
4.
So T = 4.5
Substitute as Maxi-
mum False vertices
* It is necessry to convert this weight
1 2 2 1 threshold vector to one which corre-
w1 w2 w3 w4 sponds to the original function f.
1 1 0 1 =4
1 0 1 1 =4 * For every input xi, which is compli-
0 1 1 0 =4 mented in the original function, wi
must be changed to -wi and T to T - wi

In the example, f = Σ ( 0, 1, 3, 4, 5, 6, 7,
12, 13)
inputs x3 and x4
f = x1 x2 + x1 x4 + x2
appear in f in compli x3 + x1 x3

mented form, thus in the new weighted * Determine positive function

vector,
Weights are 1, 2, -2, -1.
Threshold is 4.5 - 2- 1 = 1.5
f = x1 x2 + x1 x4 + x2 x3 + x1 x3
* Find all Minimum True and Maximal
False vertices.
The Minimum true
vertices
1 1 0 0 We obtain a system
1 0 0 1 of 12 inequalities
0 1 1 0
1 0 1 0
w1 + w2
The Maximal False vertices w1 + w4 w2 + w4
0 1 0 1 w2 + w3 w3 + w4
>
0 0 1 1
w1 + w3 w1
1 0 0 0

These impose sev- w4 = 1

eral constriants on w2 = w3 = 2
the weights associ- w1 = 3
ated with f.
Substitute as Minimum True vertices
w1 > w4 w3 > w4 w2 > 0 3 2 2 1
w1 > w2 w2 > w4 w3 > 0 w1 w2 w3 w4
w1 > w3 w4 > 0 1 1 0 0 =5
1 0 0 1 =4
0 1 1 0 =4
1 0 1 0 =5
 T must be smaller
Upper limit : Take
than 4 but larger than
minimum value
3.
So T = 3.5
Min ( 5, 4) = 4
Substitute as Maximum False vertices
Weight - threshold vector is ( 3, 2, 2, 1;
3 2 2 1
3.5)
w1 w2 w3 w4
To find the corresponding vector for
0 1 0 1 =3
the original function f, x1 and x3 must
0 0 1 1 =3
be complimented.
1 0 0 0 =3
f = ( -3, 2, -2, 1; 3.5 - 3 - 2)
Lower limit : Take maximum value.
= ( -3, 2, -2, 1; -1.5)
T=3

Cascade Realization
x1x2
x3x4 00 01 11 10
00 1
f( x1, x2, x3, x4) = Σ ( 2, 3, 6, 7, 10, 12, 14,
01
15)
11 1
1 11
Plot on 4 -variable K - Map to find out 1 1
10 1 1
whether the function is unate or not.
Unate means it has a common impli-
cant.
* f is not unate
h ( x1, x2, x3, x4) = Σ
* We have to synthe- (10, 12, 14, 15)
size it as a cascade
of two threshold

elements.
g( x1, x2, x3, x4) = Σ ( 2, 3, 6, 7,15) The weight - threshold vector for the
function h is
The weight - threshold vector for the Vh = ( 2, 1, 1, -1; 2.5)
function g is
Vg = ( -2, 1, 3, 1; 2.5)

The cascade realiza- * f must have a value

tion of the function f
is shown below. ‘1’ whenever ‘g’ does,

the minimal

x1 -2
x1 2 weighted sum must be larger than the
1
x2 g x2 h
1 2.5
2.5

3 x3 1
f
threshold of the second element.
x3

1 -1
x4 * Negative values affect the most.
 wg + 0 > 5/2 is the
x1 x2 x3 x4 Sum of wts vital case
0 0 1 0 wg + 1 > 5/2 wg > 5/2
0 0 1 1 wg + 0 > 5/2 wg = 3
0 1 1 0 wg + 2 > 5/2
0 1 1 1 wg + 1 > 5/2 wg = 3
1 0 1 0 wg + 3 > 5/2
1 1 0 0 wg + 3 > 5/2 * This is the minimum weighted sum.
1 1 1 0 wg + 4 > 5/2
1 1 1 1 wg + 3 > 5/2 So wg is calculated from this.

* As a general rule
f( x1, x2, x3, x4) = Σ (
weight of wg should 3, 5, 7, 10, 12, 14, 15)

be the sum of the

Plot on 4 -variable K - Map to find out
threshold of second element and the
whether the function is unate or not.
absolute values of all negative weights
Unate means it has a common impli
of the second element.
cant.
 * f is not unate

x1x2
* We have to synthe-
x3x4 00 01 11 10 size it as a cascade
1
00 of two threshold
01
1
elements.
11 1 11
1 g( x1, x2, x3, x4) = Σ ( 3, 5, 7,15)
1 1
10
The weight - threshold vector for the
function g is
Vg = ( -1, 1, 1, 2; 2.5)

The cascade realiza-

h ( x1, x2, x3, x4) = Σ tion of the function f
(10, 12, 14, 15) is shown below.

x1 x1 2
-1
1
The weight - threshold vector for the x2 1 g x2 h
2.5 2.5
function h is 1
3.5
x3 1
f
x3
Vh = ( 2, 1, 1, -1; 2.5) 2 -1
x4

wg = 3.5
 g
f (x1,x2,x3,x4) = x1 x2
x3x4
(2, 3, 6, 7, 8, 00 01 11 10
9, 13, 15) 00
01 1 1 1
11 1 1

Realize as a cascade of two functions. 10

g (x1,x2,x3,x4) = (2, 3, 6, 7, 15)

h (x1,x2,x3,x4) = (8, 9, 13)

h fg = x2 x3 x4+ x1 x3
x1x2 To make it positive and
x3 x4 00 01 11 10
1
ordered, compliment x1
00
01 1 1 fg = x2 x3 x4+ x1 x3
11
10
fh = x1 x3 x4+ x1x2 x3
fg = x2 x3 x4+ x1 x3 w1 = 2
w2 = 1
Min True vertices : w3= 3
0111, 1010 w4 = 1
Max False vertices : T = 4.5-2= 2.5
0011, 0110, 1101

Solving for inequalities, With x1 complimented

we get g = ( -2, 1, 3, 1; 2.5)

With x2 and x3
fh = x1 x3 x4+ x1x2 x3 complimented
Min True vertices : h = ( 2,-1, -2, 1; 1.5)
1011, 1110
Max False vertices : wg > 1.5 - ( -1 -2)
0111, 1010, 1101 > 4.5
Solving for inequalities,
we get x1 -2 x1 2
-1
w1 = 2, w2 =1, x2 1 g x2 1.5 h
2.5
w3 = 2, w4 = 1 x3
3
x3 -2
1
T = 4.5 1
x4