: Introduction -

(Functions)
(Boolean algebra)
. (karnaugh map)
.
(AND , OR , NOT…..)
. (Maxterms) (Minterms)

: Binary Logic -

AND OR NOT
X Y X .Y X+Y X Y
0 0 0 0 1 1
0 1 0 1 1 0
1 0 0 1 0 1
1 1 1 1 0 0

(Truth table) (Functions)

: Grammars -
OR AND
1 x+1 = 1 1 x.1 = x
2 x+x' = 1 2 x.x' = 0
3 x+x = x 3 x.x = x
4 x+0 = x 4 x.0 = 0
5 (x')' = x 5 (x')' = x
6 x+y = y+x 6 x.y = y.x
7 x+(y+z) = (x+y)+z 7 x.(y.z) = (x.y).z
8 x.(y+z) = x.y+x.z 8 x+y.z = (x+y).(x+z)
9 (x+y)' = x'.y' 9 (x.y)' = x'+y'
10 x+(x.y) = x 10 x.(x+y) = x
(Boolean Algebra) (Functions)
. (De Morgan) 9
 : Logic Gates -
Name Graphic Symbol Algebraic
Function

AND F = xy

OR F = x+y

Inverter F = x'

: Example
:
F1 = x + y'z
: Selution
 : Example
:
F1 = xy' + x'z
: Selution

: Example
: Simplify the following Boolean functions
x(x' + y) -
x + x'y -
(x + y).(x + y') -
xy + x'z + yz -
: Selution
(Boolean Algebra)
. (OR) (AND)

1- x(x' + y) = xx' + xy 2- x + x'y = (x+x').(x+y)

= 0 + xy = 1 .(x+y)
= xy =x+y

3- (x+y) (x+y') = x(x+y') + y(x+y') 4- xy + x'z + yz = xy + x'z + yz.(x+x')

= xx + xy' + xy + yy' = xy + x'z + xyz + x'yy
= x+xy' +xy +0 = xy(1+z) + x'z(1+y)
= x(1+y'+y) =xy +x'z
= x1
=x
 : Complement of a Function -

(A + B + C + D )' = A'B'C'D'
(ABCD)' = A' + B' +C' + D'

. (De Morgan)
:
. (OR) (AND) -
. -

: Example
: find the complement of the following functions
F1 = x'yz' + x'y'z
: Selution
F1 = (x'yz' + x'y'z)'
= (x'yz')' . (x'y'z)'
= (x+y'+z) . (x+y+z')

: explain
.
:
. (AND) (OR) -
. -
. (OR) (AND) -
. -

: Example
: find the complement of the following functions
F1 = (x+y'+z').(x'+y+z).(x'+y'+z')
: Selution
F1 = ((x+y'+z').(x'+y+z).(x'+y'+z'))'
=(x+y'+z')' + (x'+y+z)' + (x'+y'+z')'
= (x'yz) + (xy'z') + (xyz)
 Canonical and Standard Forms -

Minterms Maxterms
X Y Z Term deaignation Term deaignation
0 0 0 x'y'z' m0 x+y+z M0
0 0 1 x'y'z m1 x+y+z' M1
0 1 0 x'yz' m2 x+y'+z M2
0 1 1 x'yz m3 x+y+'z' M3
1 0 0 xy'z' m4 x'+y+z M4
1 0 1 xy'z m5 x'+y+z' M5
1 1 0 xyz' m6 x'+y'+z M6
1 1 1 xyz m7 x+'y'+z' M7

: explain
(Maxterms) (Minterms) (X,Y,Z) (Truth table)
. (Maxterms) (Minterms)

Maxterms Minterms
(OR) (AND)

(x+y'+z) (010) (x'yz') (010)

1 0
0= 1=
(Maxterms) (Minterms) :
(Minterms) (De Morgan)
 : Example
: Products of Sum Sum of Products

X Y Z F1 F2
0 0 0 0 0
0 0 1 1 0
0 1 0 0 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1

: Selution
Sum of Products Minterms
Products of Sum Maxterms

:Sum of Products( )
F1 = x'y'z + xy'z' + xyz = m1 + m4 + m7 ( 1,4,7)
F2 = x'yz + xy'z + xyz' + xyz = m3 + m5 + m6 + m7 ( 3,5,6,7)

: Products of Sum( )
F1 = (x+y+z)(x+y'+z)(x+y'+z')(x'+y+z')(x'+y+'z) = M0.M2.M3.M4 (0,2,3,5,6)
F2 = (x+y+z)(x+y+z')(x+y'+z)(x'+y+z) = M0.M1.M2.M4 (0,1,2,4)
 : Example
: Express the Boolean function F = A + B'C in a sum of minterms
: Selution
.

:
F = A + B'C
= A(B+B') + B'C
= AB +AB' + B'C
= AB(C+C') + AB'(C+C') +B'C(A+A')
= ABC + ABC' + AB'C + AB'C' + AB'C + A'B'C
= ABC + ABC' + AB'C + AB'C' + A'B'C

: explain
F = A + B'C (sum of minterms)
A,B,C :
(B'C) (A)
. (sum of minterms)

(B) (C) (A)

1
(B+B') A 1=
(C+C') (AB') (AB)
.
(A) (B'C)
.

:
F = A + B'C
= [ ABC + ABC' + AB'C + AB'C' ] + [ AB'C + A'B'C ]
= ABC + ABC' + AB'C + AB'C' + A'B'C

: explain
.
(B) (C ) (A)

. (A) (B'C)
.
 : Example
: Express the Boolean function F = xy + x'z in a product of maxterms from
: Selution
:
F = xy + x'z
= (x+x'z)(y+x'z)
= (x+x')(x+z)(y+x')(y+z)
= 1(x+z)(y+x')(y+z)
= (x+z)(y+x')(y+z)
= (x+y+z)(x+y'+z)(x'+y+z)(x'+y+z')(x+y+z)(x'+y+z)
= (x+y+z)(x+y'+z)(x'+y+z)(x'+y+z')
= M0 . M2 . M3 . M4 = (0,2,4,5) = (1,3,6,7)

: explain
F = xy + x'z (product of maxterms)
(OR) (AND)
. (OR) (AND)

(x'z) (xy)
. (x+x'z)(y+x'z)

:
F = xy + x'z
= xyz + xyz' + x'yz + x'y'z
= m7 + m6 + m3 + m1 = (1,3,6,7) = (0,2,4,5)

: explain
1= (Minterms)
0= (Maxterms)
(product of maxterms) (sum of minterms)
(sum of minterms) (product of maxterms)
1= (sum of minterms)
(1,3,6,7)
(product of maxterms) (0,2,4,5)
. (Maxterms)
 : Digital Logic Gates -

Name Graphic Symbol Algebraic Truth Table

Function

X Y F
AND F = xy 0 0 0
0 1 0
1 0 0
1 1 1

X Y F
0 0 0
OR F = x+y 0 1 1
1 0 1
1 1 1

X F
Inverter F = x' 0 1
1 0

X F
Buffer F=x 0 0
1 1

X Y F
0 0 0
NAND F = (xy)' 0 1 1
1 0 1
1 1 1

X Y F
NOR 0 0 0
F = (x+y)' 0 1 0
1 0 0
1 1 1
 X Y F
XOR F = xy' + x'y 0 0 0
= x y 0 1 0
1 0 0
1 1 1

X Y F
F = xy' + x'y 0 0 0
XNOR = x y 0 1 0
1 0 0
1 1 1
 : Introduction -
.(karnaugh map) (Functions)
. (karnaugh map)

: Map Method -

X Y Minterms
0 0 x'y' m0
0 1 x'y m1
1 0 xy' m2
1 1 xy m3

. (karnaugh map)
. (Y) 0,1 (X)
. (Y) (X)
. (Y) (X)
 : Example
: Simplify the following Boolean function
F(x,y) = x'y + x'y'
: Selution

F(x,y) = x'

: explain
. x'y + x'y'
1 (Y) 0 (X) (x'y)
1 1 (Y) (X)

1 0 0 (Y) 0 (X) (x'y')

.

:
1
4 8 16

(X)
(X) X 1 X' 0 (X)
(X) 1 0 (X)
.(Y) (Y)
(X) 1 X' =
. (Y) (Y) 0
 : Example
: Simplify the following Boolean function
F(x,y) = xy + x'y
: Selution

F(x,y) = y
: explain

(X) 1 0 (X)
. (Y) 1 (Y)

: Example
: Simplify the following Boolean function
F(x,y) = x'y' + xy' + xy
: Selution

F(x,y) = x + y'
: explain
1
. 1 1

1 0 1 2 1
1 1 3
3 0 1
1s

1s
1 1 1
.
 : Example
: Simplify the following Boolean function
F(x,y) = xy + x'y + xy' + x'y'
: Selution

F(x,y) = 1

: explain
4
.
1=

:Three Variables Map -

. (karnaugh map)
. (YZ) (X)
:
2 3 1 -
. 6 7 5
2 0 (karnaugh map) -
2 0 1s 6 4
. 6 4
 : Example
: Simplify the following Boolean function
F(x,y,z) = (3,4,6,7)
: Selution

F(x,y,z) = xz' + yz

: explain
1s
.

1
. (Z)

(X) 4,6
. (X) 1= (X)

(Z ,Y)
(Y)
(Y) 1 0 (Y)
(Z) (Z)
(Z') 0=

. 3,7

+
xz' + yz =

. +
 : Example
: Simplify the following Boolean function
F(x,y,z) = (0,1,2,4.5,6)
: Selution

F(x,y,z) = y' + z'

: Example
: Given the Boolean function
F(x,y,z) = A'C + A'B + AB'C + BC
Express it in sum of minterms -
Find the minimal sum of products expression -
: Selution

F(x,y,z) = (1,2,3,5,7) -
F(x,y,z) = C + A'B -

: explain

(sum of products)
1s
.
 Four Variables Map -

. (karnaugh map)
. (X) (W)
(karnaugh map)
.
(karnaugh map)
.
. (karnaugh map) (karnaugh map)

: Example
: Simplify the following Boolean function
F(w,x,y,z) = (0,1,2,4,5,6,8,9,12,13,14)
: Selution

F(w,x,y,z) = y' + w'z' + xz'

: explain
. (karnaugh map)

.
 : Example
: Simplify the following Boolean function
F(w,x,y,z) = (0,2,3,5,7,8,9,10,11,13,15)
: Selution

F(w,x,y,z) = wx' + yz + xz + x'z'

: Don't Care Conditions -

: Example
: Simplify the following Boolean function
F(w,x,y,z) = (0,3,7,11,15)
Which has the don't care conditions
d(w,x,y,z) = (0,2,5,8)
: Selution

F(w,x,y,z) = w'x' + yz
 : explain
. (x) (Don't care)
(Don't care)
(Don't care)
. 1s

(Don't care) 1s (karnaugh map)

.
3,7,15,11
.

0,1,3,2,
1,3 (Don't care)
(Don't care)
.

(Don't care)
. 5,8 (Don't care)
.