2

3
 4

x y x y x y x+y x x
0 0 0 0 0 0 0 1
0 1 0 0 1 1 1 0
1 0 0 1 0 1
1 1 1 1 1 1
 5

x y z y+z x.(y+z) x.y x.z (x.y)+(x.z)

0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 0
0 1 0 1 0 0 0 0
0 1 1 1 0 0 0 0
1 0 0 0 0 0 0 0
1 0 1 1 1 0 1 1
1 1 0 1 1 1 0 1
1 1 1 1 1 1 1 1
 6

x x x+x x.x
0 1 1 0
1 0 1 0
 7

x+x = (x+x).1 by postulate 2b (identity)

= (x+x).(x+x) 5a (complement)
= x+(x.x) 4b (disribution, reverse side)
= x+0 5b (complement)
=x 2a (identity)

x.x = (x.x)+0 by postulate 2a (identity)

= (x.x)+(x.x) 5b (complement)
= x.(x+x) 4a (disribution, reverse side)
= x.1 5a (complement)
=x 2b (identity)
 8

x+1 = (x+1).1 by postulate 2b (identity)

= (x+1).(x+x) 5a (complement)
= x+(1.x) 4b (disribution, reverse side)
= x+x 2b (identity)
=1 5a (complement)
9
 10

x y z y+z x+(y+z) x+y (x+y)+z

0 0 0 0 0 0 0
0 0 1 1 1 0 1
0 1 0 1 1 1 1
0 1 1 1 1 1 1
1 0 0 0 1 1 1
1 0 1 1 1 1 1
1 1 0 1 1 1 1
1 1 1 1 1 1 1
 11

x+xy = x.1+xy by postulate 2b (identity)

= x.(1+y) 4b (disribution,reverse)
= x.1 theorem 2a
=x postulate 2b
 12

(x+y)+(xy) =(x+1.y)+(xy) by postulate 2b (identity)

= x+(x+x)y+xy by postulate 5a (complement)
= x+xy+xy+xy by postulate 4a (distribution of . on +)
= x+xy+x(y+y) by postulate 4a (reverse)
=x+xy+x.1 by postulate 5a (complement)
=x+x+xy by postulate 2b (idendity) and
reorganization
=1+xy by postulate 5a (complement)
=1 Theorem 2a
 13

(x+y).(xy) =xxy+xyy by postulate 4a (distribution of . on +)

= 0.y+x.0 by postulate 5b (complement)
= 0+0 by theorem 2b
=0 by postulate 2a (idendity)
14
 15

1 if x 0 or (y 1 and z 1)
F1
0 otherwise

x y z F1
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 1
16
 17

x
F1

y
z
 18

x y F1 F2
0 0 0 0
0 1 1 1
1 0 1 1
1 1 1 1

F1
x F2
x

y
y
19
20
21
22
 23

x y z f f
0 0 0 0 1
0 0 1 1 0
0 1 0 1 0
0 1 1 1 0
1 0 0 0 1
1 0 1 1 0
1 1 0 0 1
1 1 1 1 0
 24

Sum of products: Product of sums:

Ex: F1=y+xy+xyz Ex: F2=x(y+z)(x+y+z)
3 product terms of 1,2 and 3 literals 3 pruduct terms of 1,2 and 3 literals
Sum is an OR operation Product is an AND operation.
A group of AND gates followed by an A group of OR gates for the sum terms
OR gate. followed by an AND gate.
2 level implementation. 2 level implementation.

y x

F1 y F2
x
z
y

x x
y y
z z

Assuming complements are available, Assuming complements are available,

each product term requires an AND each sum term requires an OR gate
gate and logic sum is formed with an and logic product is formed with an
OR gate. AND gate.
 25

Minterms Maxterms (Mi=mi)

x y z term designation term designation
0 0 0 0 xyz m0 x+y+z M0
1 0 0 1 xyz m1 x+y+z M1
2 0 1 0 xyz m2 x+y+z M2
3 0 1 1 xyz m3 x+y+z M3
4 1 0 0 xyz m4 x+y+z M4
5 1 0 1 xyz m5 x+y+z M5
6 1 1 0 xyz m6 x+y+z M6
7 1 1 1 xyz m7 x+y+z M7

n
22
 26

Minterms Maxterms (Mi=mi)

x y z term designation term designation
0 0 0 0 xyz m0 x+y+z M0
1 0 0 1 xyz m1 x+y+z M1
2 0 1 0 xyz m2 x+y+z M2
3 0 1 1 xyz m3 x+y+z M3
4 1 0 0 xyz m4 x+y+z M4
5 1 0 1 xyz m5 x+y+z M5
6 1 1 0 xyz m6 x+y+z M6
7 1 1 1 xyz m7 x+y+z M7
 27

Minterms Maxterms (Mi=mi)

x y z term designation term designation
0 0 0 0 xyz m0 x+y+z M0
1 0 0 1 xyz m1 x+y+z M1
2 0 1 0 xyz m2 x+y+z M2
3 0 1 1 xyz m3 x+y+z M3
4 1 0 0 xyz m4 x+y+z M4
5 1 0 1 xyz m5 x+y+z M5
6 1 1 0 xyz m6 x+y+z M6
7 1 1 1 xyz m7 x+y+z M7
28
 29

F =A+BC 3 variables A,B,C

A =A(B+B)=AB+AB
=AB(C+C)+AB(C+C)
=ABC+ABC+ABC+ABC

BC =(A+A)BC
=ABC+ABC

F =A+BC
=ABC+ABC+ABC+ABC+ABC (the order of varibles in
= m7 + m6 + m5 + m4 + m1 the expression is important)

F(A,B,C) = (1,4,5,6,7)

variables ORing minterms
 30

A B C F minterms
0 0 0 0
0 0 1 1 m1
0 1 0 0 F(A,B,C) = (1,4,5,6,7)
0 1 1 0
1 0 0 1 m4
1 0 1 1 m5
1 1 0 1 m6
1 1 1 1 m7
 31

n
22

 32

F(x,y,z) = (0,2,4,5)

variables ANDing maxterms
 33

x y z F minterms maxterms
0 0 0 0 M0
0 0 1 1 m1
0 1 0 0 M2 F(A,B,C) = (0,2,4,5)
0 1 1 1 m3 =(x+y+z)(x+y+z)(x+y+z)(x+y+z)
1 0 0 0 M4
1 0 1 0 M5
1 1 0 1 m6
1 1 1 1 m7
 34

A B C f1 f2=f1 f1=xyz+xyz+xyz
0 0 0 0 m0 1 M0 =m1+m4+m7
0 0 1 1 m1 0 M1
0 1 0 0 m2 1 M2 f2=f1=xyz+xyz+xyz+xyz+xyz
0 1 1 0 m3 1 M3 = m0+m2+m3+m5+m6
1 0 0 1 m4 0 M4
1 0 1 0 m5 1 M5 f1=f2= m0m2m3m5m6
1 1 0 0 m6 1 M6 = M0 . M2 . M3 . M5 . M6
1 1 1 1 m7 0 M7 f1=(x+y+z)(x+y+z)(x+y+z)(x+y+z)(x+y+z)
35
 36

x y z F
0 0 0 0 M0
0 0 1 0 M1 F(x,y,z) = (3, 6,7)
0 1 0 0 M2 =(0,1,2,4,5)
0 1 1 1 m3
1 0 0 0 M4
1 0 1 0 M5
1 1 0 1 m6
1 1 1 1 m7
 37
STANDARD & CANONICAL FORMS (SUMMARY)
Function F in
NONSTANDARD FORM
Ex: F(x,y,z)=xy'+x(y'+z')(y+z)
Expand: Expand:
A(B+C)=AB+AC A+BC=(A+B)(A+C)
You may simplify
A+AB=A
A(A+B)=A TRUTH
A+AB=A+B TABLE
A(A+B)=AB
as necessary
SUM OF PRODUCTS PRODUCT OF SUMS
STANDARD FORM: Ti+Tj+... (Ti)(Tj)....
Ex: F(x,y,z)=xy'+xz' Ex: F(x,y,z)= x(y'+z')
Expand term T Expand term T
missing x as: Rows Rows missing x as:
T=T(x'+x) F=1 F=0 T=(T+x'x)
=Tx'+Tx =(T+x')(T+x)
SUM OF MINTERMS to convert PRODUCT OF MAXTERMS
CANONICAL FORM: mi+mj+.... each other (Mk)(Mp)
(minterm-no) form (Maxterm-no)
Ex: interchange Ex:
F(x,y,z)=xy'z'+xy'z +xyz' with F(x,y,z)=(x+y'+z')(x+y'+z)(x+y+z')
F(x,y,z)=m4+m5+m6 (x+y+z)(x'+y'+z')
F(x,y,z)== (4,5,6) and F(x,y,z)=M3.M2.M1.M0.M7
with missing F(x,y,z)= (0,1,2,3,7)
terms
 38
NON
F(x,y,z)=xy'+x(y'+z')(y+z)
STANDARD FORM
STANDARD FORM SUM OF PRODUCTS PRODUCT OF SUMS
Expand: A(B+C)=AB+AC Expand: A+BC=(A+B)(A+C)
F(x,y,z) =xy'+x(y'+z')(y+z)
You may simplify =xy'+(xy'+xz')(y+z) F(x,y,z)=xy'+x(y'+z')(y+z)
A+AB=A =xy'+xy'y+xy'z+xyz'+xzz' =(xy'+x)(xy'+(y'+z')(y+z))
A(A+B)=A =xy+xy'z+xyz = x(xy'+(y'+z')(y+z))
A+AB=A+B =xy'+xyz' = x(xy'+(y'+z')) (xy'+(y+z))
A(A+B)=AB can be further simplified as = x(x+y'+z')(y+y'+z')
etc F(x,y,z)= xy+xyz=xy(1+z)+xyz (x+y+z)(y+y+z)
= xy+xyz+xyz = x(x+ y'+z')(y'+z')(x+y+z)1
= xy+x(y+y)z=xy+x1z =x(y+z)
= xy+xz

CANONICAL FORM SUM OF MINTERMS PRODUCT OF MAXTERMS

Expand: T=T(x'+x) =Tx'+Tx Expand: T=(T+x'x)=(T+x')(T+x)
F(x,y,z)= (x)(y+z)
=(x+yy+zz)(xx+y+z)
F(x,y,z)= xy'+xyz' =(x+y+zz)(x+y+zz)
=xy'(z'+z)+xyz' (x+y+z)(x+y+z)
= xy'z'+xy'z+xyz' =(x+y+z)(x+y+z)
F(x,y,z)= m4+m5+m6 (x+y+z)(x+y+z)
= (4,5,6) (x+y+z)(x+y+z)
F(x,y,z)=M3.M2.M1.M0.M7
F(x,y,z)= (0,1,2,3,7)
to convert one cononical form to another interchange
with , and list those numbers missing from the original form
 39

xyz F m4 m5 m6 M0 M1 M2 M3 M7
0 000 0 0 0 0 0 0 1 1 1 1 0
1 001 0 0 0 0 0 1 0 1 1 1 0
2 010 0 0 0 0 0 1 1 0 1 1 0
3 011 0 0 0 0 0 1 1 1 0 1 0
4 100 1 1 0 0 1 1 1 1 1 1 1
5 101 1 0 1 0 1 1 1 1 1 1 1
6 110 1 0 0 1 1 1 1 1 1 1 1
7 111 0 0 0 0 0 1 1 1 1 0 0
m4 + m5 + m4 M0 . M1 . M2 . M 3 . M7
xy'z' +xy' +xyz' =F (x+y+z) (x+y+z') (x+y'+z) (x+y'+z') (x'+y'+z') =F
z
 40

A
B
F3

D
E

A
B

C F3
D

C
E
 41
n
22

xy F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 F12 F13 F14 F15

00 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1
01 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1
10 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1
11 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
 42
n
22
XY Symbol Name Expression Comments
00 01 1 11

F0 0 0 0
0
0

Null 0 Binary constant 0
F1 0 0 0 1 x.y AND xy x and y
F2 0 0 1 0 x/y Inhibition xy x but not y
F3 0 0 1 1 Transfer x x
F4 0 1 0 0 y/x Inhibition xy y but not x
F5 0 1 0 1 Transfer y y
F6 0 1 1 0 xy ExclusiveOR xy+xy x or y but not both
F7 0 1 1 1 x+y OR x+y x or y
F8 1 0 0 0 xy NOR (x+y) Not-OR
F9 1 0 0 1 xy Equivalence xy+xy x equal y
F10 1 0 1 0 y Complement y Not y
F11 1 0 1 1 xy, xy Implication x+y If y then x
F12 1 1 0 0 x Complement x Not x
F13 1 1 0 1 xy, xy Implication x+y If x then y
F14 1 1 1 0 xy NAND (xy) Not-AND
F15 1 1 1 1 Identity 1 Binary constant 1
43
44
 45
Alternative
commu n-input GRAPHICAL
F GATE Function associativity GRAPHICAL
tativity operation SYMBOL
SYMBOL
BUFFER x NA NA NA x x

NOT x NA NA NA x x

x (yz) x x.y.z
AND xy xy=yx =(xy) z xyz y
z
=xyz
x+(y+z) x x+y+z
+ OR x+y x+y=y+x =(x+y)+z x+y+..+z y
=x+y+z z

xy
(xyz) x (x.y.z) x x+y+z
NAND =(x.y) xy=yx NO y y
=x+y++z z
=x+y z
xy
(x+y++z) x (x+y+z) x x.y.z
NOR =(x+y) xy=yx NO y y
=xy... z z z
=xy
sum of
XOR x(yz) minterms with x
x
xy xyz y
Exclusive- xy=yx =(xy)z odd # of y
=xy+xy z
z
OR =xyz unprimed
literals
sum of x xyz x
xy x(yz) y
XNOR minterms with y

=xy+xy xy=yx =(yx)z z z
(equivalence) even # of
=(xy) =xyz
primed literals
 46

NAND NOR
x (xyz) x (x+y+z)
y y
z z
x x+y+z=(xyz) x xyz=(x+y+z)
y y
z z

NOT 1 input NAND gate behaves like an 1 input NOR gate behaves like an
inverter inverter
x x x x x x x x

AND requires 2 NAND gates a NOR gate with additional inverters at

each input (3 NOR gates)

x x
xy (x+y)=xy
y
y

OR a NAND gate with additional inverters requires 2 NOR gates

at each input (3 NAND gates)
x x x+y
(xy)=x+y y
y
 47

Given 1,2) 3)

A A
A
B B
B
C F
C F F
D C
D D
E
E E
 48

Given 1,2) 3)

A A A
B B B
F C F F
C C
D D D

E E E
 49

A A
B B
A A
F
B B
F

C C
D D

A
B

A
B F

C
D
 50

y y

x x
w w
F F
x x
z z

z z
w w

y
x
w
F
x
z
z
w
 51

(x+y+z)
A A
B
B
C
C

x
w
F
x
z

z
w
 52

D
x C
w
A
z
B

w F

y
 53

x y xy' x' y
(x y)' xy x' y'
x 0 x
x 1 x'
x x 0
x x 1

x y' x' y (x y)'

 54

xy

xy

y
 55

A B C ABC
0 0 0 0
0 0 1 1 m1
0 1 0 1 m2
0 1 1 0
1 0 0 1 m4
1 0 1 0
1 1 0 0
1 1 1 1 m7
 56

,', ,', NAND, NOR, ,', ,',

,,, ,,, 1,,, 1,,, 0,,, 0,,,

 57

1,,
1 a a'
(a b) (a b) a b
not minimal

1,,
a b AND (already in the set)
1 a a' NOT
(a b) (a b) a b OR
minimal complete

 58

Logic system Signal level Logic value

High 1
Positive logic system
Low 0
High 0
Negative logic
system Low 1
 59

Signal level gate function Positive logic assignment Negative logic assignment
with L=0 and H=1 with L=1 and H=0

x y z x y z x y z
L L L 0 0 0 1 1 1
L H L 0 1 0 1 0 1
H L L 1 0 0 0 1 1
H H H 1 1 1 0 0 0

Same as AND operation Represents OR operation

even though entries are
reversed

Polarity indicator: signifies that

negative logic is assumed for the
signal
60
 61

SSI Small scale of gates <10 several independent gates in a

integration single package

MSI Medium scale 10< of gates <1000 decoders, adders

integration
LSI Large scale 1000< of gates processors, memory
integration
VLSI Very large of gates 100 000 large memory arrays, complex
scale microchips
integration
 62

TTL transistor-transistor
logic
ECL emitter-coupled high speed
logic operation
MOS metal-oxide high component
semiconductor density
CMOS complementary low power
metal-oxide consumption
semiconductor
63