Digital Logic Design For Boolen Algebra

Boolean Algebra
Boolean Expressions and Theorems:

1. A. 0
=0
7. A + A
=1
2. A. 1
=A
8. A + A
=A
3. A. A
=A
9. A + AB = A
=0
10. A+ A B = A + B
4. A. A
5. A + 0
=A
11. A + B
= B+ A
6. A + 1
=1
12. A . B
=B.A
De- Morgans Law :
1. A B
=A +B
13. A ( B C)
= (A B) C
14. (A + B) +C = (A )+(B+ C)
15 A + B C = (A + B) ( A+C)
15.
2. A + B
EC214 Digital Logic Design

J Ravindranadh , Associ. Prof
=A B
Simplify the given boolean expression
f = ABC+ ABC + BC
= ABC + BC ( A + 1)
= ABC + BC
= BC ( A + 1)
= BC
f = XYZ + X Y + XY Z
= XY ( Z + Z ) + X Y
= XY
+ XY
= Y (X + X )
= Y
f = xyz + xyz + xyz + xyz

= xz( y + y) + xy(z + z)
= xz + xy
f = ABC + ABC + AB + ABC + ABC

= A B ( C + C ) + AB ( C + C ) + A B
= A B + AB + A B
= A B + A(B + B )
= A B + A
= A + B
f = xy + xz + yz
= xy + x z + yz ( x + x )
= xy + x z + xyz + x yz
= xy ( 1 + z ) + x z ( 1 + z )
= xy + x z
f = ( A + B)( A + B )( A + C)
= ( AA + A B + AB + B B )( A + C )
= ( AA A + A A B + AB A + AAC + A B C + ABC )
= AC (1 + B ) + A B C
= AC + A B C
= AC (1 + B )
= AC
f = ( A + B)(A + B + D)D
= ( A A + AB
+ A B + BB
+ A D )D
= AB D + A B D + B D + A D D
= B D ( 1 + A ) + AB D
= B D + AB D
= B D (1 + A )
= B D
f = AB + AB ( A C )
= AB + A B ( A + C )
= AB + AA B + A B C
= AB + A B ( A + C )
= AB + A B + A B C
= AB + A B (1 + C ) = AB + A B
= A(B + B )
= A
f = ( A+ B)(AC + C)(B. AC)

= ( A + B)( A + C )( B + AC) = ( AA + A B + AC + BC)( B + A + C )
= ( A B + AC + BC)( B + A + C )
r
= A BB + AB C + BBC + A A B + A AC + ABC + A BC + ACC + BCC
= AB C + A B + ABC + A BC
= AC( B + B) + A B(1 + C )
= AC + A B
f = BC + AC + AB + BCD
= AC + BC
f= A B ( A + C ) + A B ( A + B + C )
= A +B
F = ABC + (B + C )(B + D) + A + C + D
= B+CD
F = ( x + y) x ( y + z ) + xy + xz
=1

Logic Gates
Logic
gate
OR
AND
Boolean
Truth
expression table
Y=A+B
Y A.B
Y=A
AB
00
01
10
11
AB
00
01
10
11
Logic
diagram
IEEE
symbol
Switching logic
Y
0
1
1
1
Y
0
0
0
1
Logic
gate
g
NOT
NOR
Boolean
expression
p
Truth
table
Y=A
Y=A + B
NAND Y=A . B
A
0
1
Logic
diagram
g
IEEE
symbol
y
Switching logic
Y
1
0
AB
00
01
10
11
Y
1
0
0
0
AB
00
01
10
11
Y
1
1
1
0

Logic Gates
Logic
gate
EX-OR
EXEX
NOR
Boolean
expression
Y=A B + A B
Y=A B + A B
Truth
table
Logic
diagram
AB
00
01
10
11
Y
0
1
1
0
AB
00
01
10
11
Y
1
0
0
1
IEEE
symbol

Switching logic
Universal Gates
The NAND and NOR gates are universal gates.

All other gates/functions can be implemented by NOR or NAND gates. So
they are called universal gates. ( or) A universal gate is a gate which can
implement any Boolean function without need to use any other gate type.
Advantage of NAND and NOR gates are economical and easier to fabricate
The basic gates NAND and NOR are used in all IC digital logic families.

10
NAND Gate is a Universal Gate
I
Implementing
l
ti
an Inverter
I
t Using
U i
only
l NAND Gate
G t
Implementing AND Gate Using only NAND Gates
Implementing OR Gate Using only NAND Gates

11
Implementing EX-OR Gate Using only NAND Gate
Implementing EX-NOR Gate Using only NAND Gate

12
NOR Gate is a Universal Gate
I
Implementing
l
ti
an Inverter
I
t Using
U i
only
l NOR Gate
G t
Implementing OR Gate Using only NOR Gates
Implementing AND Gate Using only NOR Gates

13
Implementing EX-NOR Gate Using only NOR Gate
Implementing EX-OR Gate Using only NOR Gate

14
Minterms & Maxterms
Minterms
Minterms is a product terms that contain all variable present in either true
or complemented form.
For n variables there 2n minterms
Maxterms
Maxterms is a sum terms that contain all variable present in true or
complemented form.
F n variables
For
i bl
there
h
2n maxterms
15
For Minterms:
1 means the variable is Not Complemented and
0 means the variable is Complemented.
For Maxterms:
0
0 means the variable is Not
Not Complemented
Complemented and
1 means the variable is Complemented.
16
Canonical form
Boolean functions expressed as a sum of minterms or product of maxterms

are said to be in canonical form.
Example: Express the boolean function F= A + B C in a sum of minterms.
F
Function
ti
has
h three
th
variable
i bl A,B
A B and
d C
First term A is missing two variable
A= A(B+B) = AB + AB still missing the one variable
A= AB(C+C
A
AB(C+C)) = AB
AB(C+C)
(C+C ) = A B C + A B
B C
C + A B
B C + A B
B C
C
Second term BC missing one variable
BC= (A +A)BC = A B C + A B C
Combining all terms F= A + B C
F= A B C + A B C + A B C + A B C + A B C + A B C
F= A B C + A B C + A B C + A B C + A B C
= m1 + m4 + m5 + m6 + m7
Short notation: F(A,
F(A B,
B C)=
C) ( 1
1, 4,
4 5,
5 6,7)
6 7)
17
Example: Express the Boolean function F= x y + x z in a product of maxterm

form.
F= x y + x z = ( x y + x ) ( x y + z )
= ( x + x ) ( x + y) ( x + z ) ( y + z)
= ( x + y) ( x + z ) ( y + z )
The function has three variable x, y, and z. Each OR term is missing one variable
( x + y ) = ((x + y +
+z z)
) = ( x + y + z ) ( x + y + z )
( x + z ) = ( x + z +y y) = ( x + y + z ) ( x + y + z )
( y + z ) = ( y + z +xx) = ( x + y + z) ( x + y +z)
Combining all the terms and removing those that appear more than once.
F = ( x + y + z ) ( x + y + z) ( x + y + z) ( x + y + z)
= M0 M2 M4 M5
Short notation
F = ( 0, 2, 4, 5)

18
Express the function Y= A + B C in (a) canonical SOP (b) canonical POS
Y = ( 1, 4, 5, 6, 7)
Y = ( 0, 2, 3 )
Express the following functions in a sum of minterms and product of maxterms
F(A,B,C,D) = D (A + B) + B D
F= (1,3,5,7,9,11,13,15)
F( w, x,y,z) = y z + w x y + w x z + w x z
F= ((1,3,5,9,12,13,14)
, , , , , , )
F= ( 0,2,4,6,8,10,12,14)
F= ( 0,2,4,6,7,8,10,,11,15)
, , , , , , ,, , )
F( A,B,C) = ( A + B ) ( B + C)
F= ( 2,4,5,6)
F= (0,1,3,7)
F = ( x y + z) ( y + x z )
F= (3,5,6,7)
(3 5 6 7)
F= ( 0
0,1,2,4)
1 2 4)
19
Standard forms
Standard form configuration , the terms that form the Boolean function
may contain one, two, or any number of literals.
There are two types of standard forms : the sum of products and product of
sums
Example : Function expressed in sum of products ( S O P)
F1 = y + x y + x y z
Example : Function expressed in product of sum ( P O S )
F2 = x ( y +z) ( x +y + z)
All canonical forms are standard form but standard forms are not
canonical forms
20
Karnaugh Maps
In 1953, Maurice Karnaugh invented a graphical way of visualizing and then

simplifying Boolean expressions.
Thi graphical
This
hi l representation
t ti
, now known
k
as Karnaugh
K
h map, or K-Map.
K M
AK
K-map
map : matrix consisting of rows and columns that represent the output
values of a Boolean function
K-map can be of two forms
Sum of-Product (SOP) Form

Product of- Sum ( POS) Form

21
Rules for K-map Simplification using Sum of Products Form ( SOP)
Groupings can contain only 1s; no 0s

Groups can be formed only at right angles ; diagonal groups are not allowed
The number of 1s in a group must be a power of 2- even if it contain a
single 1
The groups must be made as large as possible
Groups can overlap and wrap around the sides of the K-map

22
Two variable K-map

p
B
AB
AB
AB
AB
m0
m1
m2
m3
AB
Simplify
p y the Boolean expression
p
in S O P Y(A,B)=
( , ) ( 2,, 3))
B
A
0
1
F=A
1
23
Simplify the Boolean expression in S O P Y(A,B)= (0, 1, 3)
B
A
1
Y = A + B
Simplify the expression Y= ( 0, 2, 3)
B
A
1
Y = A + B

24
Simplify the boolean expression Y ( A,B)= ( 1, 2 )
B
A
1
1
Y= A' B + A B'
= (A B)
Simplify the expression Y(A,B) = ( 0, 1,2, 3, )
B
A
1
Y=1
1
25
Three Variable K-map
BC
A
00
01
11
10
m0
m1
m3
m2
m4
m5
m7
m6
Simplify the expression Y ( x

x, y
y, z)= ( 3
3, 5,
5 6,
6 7)
yz
00
01
11
10
x
0
1
1
1
Y= y z + x z + x y

26
Simplify the expression Y( A,B,C)= ( 2, 3, 4, 5 )

BC
A
00
01
0
1
11
10
1
Y= A'
A B+AB
B = (A B)
Simplify the expression f( x, y, z)= ( 0,1,2, 3, 6, 7 )

yz
x
0
1
00
01
11
10
f = x' + y

27
Simplify the expression Y(A,B,C)= ( 1, 3, 4, 6 )

BC
A
00
0
1
01
11
10
Y= A'
A C + A C'
C =(A C)
Simplify the expression Y= ( 0, 2, 4, 6, 7 )

BC
A
00
01
11
10
1
Y= C' + A B

28
Simplify the expression Y= ( 1, 2, 4, 7 )

BC
A
00
0
1
01
11
1
1
10
1
Y = A B'
B C
C' + A'
A B
B' C + A B C+ A'B
A B C
C
= (A B C)
Simplify the expression (a) P O S (b) S O P f = ( 0, 1, 2, 3, 4, 6 )

BC
A
00
01
11
10
BC
A
f= (A) (C )
00
01
11
10
f= A C
29
Simplify the expression in P O S

BC
A
0
1
00
01
11
00
10

BC
A
Y= ( 0, 1, 4, 5, 6)
Y = B ( A
A + C)
f = ( 1, 2, 3, 5, 6, 7 )
01
11
10
f= (B) (C )

30
Simplify the expression (a) S O P (b) P O S Y= B C + A C +A B + A B C

BC
A
00
01
11
10
BC
A
0
01
11
10
0
Y = B C + A C
00
Y = (B + C)
C)(A+C)
Simplify the expression ( a) S O P ( b) P O S Y= A B + B C + B C

BC
A
00
01
11
10
Y= A
A B + C'
C
BC
A
00
01
11
10
Y ( B + C ) ( A + C)
Y=
31
Simplify given boolean expression Y= ( 0,1,2,3,6) (a) S O P (b ) P O S

BC
A
00
01
11
10
0
1
BC
A
0
1
Y = A B
B +AC
00
01
11
10
Y= A ( B + C )

32
Four Variable K-map
CD
AB
00
01
11
10
00
m0
m1
m3
m2
01
m4
m5
m7
m6
11
m12 m13 m15 m14
10
m8
m9
m11 m10
Simplify the expression in S O P

Y= ( 1, 4, 5, 6, 12, 14)
Y= B D + A C D
CD
AB
00
00
01
11
10
01
11
1
1
10
33
Simplify the expression in S O P Y= ( 1,2,3,5,7,9,10,11,13,15)
CD
AB
00
01
0
11
10
0
00
01
11
10
Y= D + B C

Y= ( 1, 3, 4,5, 9, 10, 11, 12, 13 )
Y= B C+ B D + A B C
CD
AB
00
00
01
11
01
11
10
10
1
34
Simplify the expression
CD
AB
00
00
01
0
11
11
10
0
1
01
10
Y= ( 0, 2, 5, 7, 8, 10, 13, 15)
Y= B D + B D

Y= ( 0,1, 4, 5, 8, 9, 10, 11, 14, 15)
Y= ( A + C ) ( A + C) ( A + B) (or) (B + C )
CD
AB
00
01
00
01
11
10

11
10
0
35
Simplify the expression
Y= ( 0, 1, 4, 5, 6, 8, 9,12, 13,14)
CD
AB
00
01
0
11
00
01
11
10

Y= ( 1, 3, 5, 7, 8, 9, 12, 13)
Y= ( A + C ) ( A + D)
10
0
Y= C ( B + D)
CD
AB
00
01
11
00
01
11
10

10
36
Obtain (a) minimal sum of product (b) product of sum Y= ( 0, 1, 2, 5, 8,9, 10)
CD
AB
00
01
0
00
01
11
10
0
1
Y= B D + A C D + B C
11
10
CD
AB
00
01
00
Y= ( A + B ) ( C + D ) ( B + D )
11

10
01
10
11
0
37
Obtain (a) minimal sum of product (b) product of sum

Y= A B D + A C D + A B + A C D + A B D
CD
AB
00
00
01
11
10
01
11
10
1
Y= B D + A D + B D +
(or) A B
CD
AB
00
00
01
11
10
01
Y= ( B + D) ( A + B + D )
11
10

0
0
0
38
Obtain (a) minimal sum of product (b) product of sum

F(A,B,C,D) = ( 1,3,7,9,11,15 )
CD
AB
00
00
01
11
10
01
11
10
CD
AB
00
01
11
00
01
11
10
10
F= (C
(C + D
D )(B+D
D))
F= D + B C

39
Five Variable K-map

A=0
A=1
DE
BC
00
01
11
10
DE
BC
00
m0
m1
m3
m2
00
m16 m17 m19 m18
01
m4
m5
m7
m6
01
m20 m21 m23 m22
11
m12 m13 m15 m14
11
m28 m29 m31 m30
10
m8
10
m24 m25 m27 m26
m9
m11 m10

00
01
11
10
40
Simplify the boolean fuction

F(A,B,C,D,E) = ( 0,2,4,6,9,11,13,15,17,21,25,27,29,31)
A=0
DE
BC
00
00
01
01
A=1
11
10
DE
BC
00
01
00
01
11
11
11
10
10
10
F= B E + A D
F
D E + A
A B
B E
E
41

F(A,B,C,D,E) = ( 2,3,10,11,12,13,16,17,18,19,20,21,26,27 )
A=0
DE
BC
00
01
00
11
10
DE
BC
00
A=1
01 11
00
01
01
11
10
10
11
1
10
F= C
F
C D + A B
B D
D + A
A B C D
D
42

F(A,B,C,D,E) = ( 8,9,10,11,13,15,16,18,21,24,25,26,27,30,31 )
A=0
DE
BC
00
01
11
10
DE
BC
00
00
00
01
01
11
10
A=1
01 11
1
1
11
1
10
10
F= B C
F
C +A
+A B E +ABD+ A C
C E
E + A B
B C D
D E
43

F(A,B,C,D,E) = ( 0,1,4,8,12,13,15,16,17,23,29,31 )
A=0
DE
BC
00
01
00
01
11
10
11
10
DE
BC
00
A=1
01 11
00
01
0
11
10
0
0
10
F= ( A + D + E) ( B
F
B + C
C +E )) ( B + C + D) (A
(A + C
C + D
D + E
E )
44

F(A,B,C,D,E) = ( 0,1,4,5,6,18,19,22,23 )
A=0
DE
BC
00
01
00
01
11
10
A=1
01 11
10
00
01
DE
BC
11
11
10
10
00
F= ( A + B +D ) ( A
F
A + B + D
D ) ( B +C
+C + D
D + E ) (or) ( A + B + C
C + E)
45
DONT- CARE CONDITIONS

1 D
1.
Don't
't care terms
t
are those
th
which
hi h are nott the
th compulsory
l
t
terms
,while
hil solving
l i
k'map we have to consider those don't care terms if required otherwise we don't
have to care about those term.
2. Dont care will help to minimize the boolean expressions.
3 Dont care
3.
ca e represent
ep esent X
Simplify the Boolean function F( w,x,y,z) = ( 1,3,7,11,15 ) + d ( 0,2,5 )
yz
wx
00
01
00
01
11
10
11
10
F= w
w z+yz
46
Simplify the expression in S O P Y= ( 4,5,6,8,9) + d ( 3, 7, 10,11,14,15 )
CD
AB
00
01
0
00
01
10
0
X
1
11
10
11
Y= A B + A B
=AB
CD
AB
00
00
01
11
10

Y= ( 0,3,4,5,7 ) + ( 8,9,10,11,12,13,14,15)
Y= C D + C D + B C ( or) B D

01
11
10
47
Simplify the expression in P O S F= ( 4, 6, 8, 9,10, 12, 13,14) + d ( 0,2,5 )
YZ
WX
00
01
0
11
10
0
00
01
11
10

Y= ( 1,2,6, ) + d ( 8,9,10,11,12,13,14,15)
F= Z ( W + Y )
CD
AB
00
00
01
11
01
Y= ( C + D) ( B + C + D )
10
11
10

48
Simplify the boolean function (a) S 0 P (b) P O S

F(A,B,C,D) = ( 1,5,6,12,13,14) + d (2,4)
CD
AB
00
00
01
11
10
01
11
10
Y= ( C + D) ( A + B) ( B + D )
F= B C + B D + A C D
CD
AB
00
00
01
01
11
10
11
10

0
0
0
49

F(A,B,C,D,E) = ( 1, 5,9,11,13,15,25,2729,31) + d( 3, 16,17,20,21)
A=0
DE
BC
00
A=1
01
11
10
00
01
11
11
10
10
DE
BC
00
01
00
01
11
10
F= D
F
D E + B E
50
Simplify the boolean function (a) S 0 P (b) P O S

F(A B C D E) = ( 0
F(A,B,C,D,E)
0,1,3,8,9,13,15,19,24,27)
1 3 8 9 13 15 19 24 27) + d (14,16,17,25,31)
(14 16 17 25 31)
A=1
A=0
DE
BC
00
01
11
00
10
DE
BC
00
01
11
00
01
01
11
10
10
1
1
11
10
X
1
F= C D + A B C E + B C E + A C E

51
A=1
A=0
DE
BC
00
01
11
00
01
11
10
10
DE
BC
00
01
00
01
11
10
11
10
0
F= ( B + C) ( D + E ) ( A + C ) ( C + D + E ) ( A + B + C + D)

52
Simplify the minimum sum of product and minimum product of sum for given
Boolean function
F(A,B,C,D,E) = ( 0,1,2,6,7,9,10,15,16,18,20,21,27,30) + d ( 3, 4, 11,12,19 )
A=0
DE
BC
00
01
11
10
DE
BC
00
A=1
01 11
00
00
01
01
11
10
10
11
1
10
1
1
F= B
F
B C
C E
E + A
A C
C E + A
A C
C D + C
C D E + A B
B C D
D + A B C D E
E
+ A D E + A B D (or) A B E
53
Simplify the minimum product of sum for given

Boolean function
F(A,B,C,D,E) = ( 5,8,13,14,17,22,23,24,25,26,28,29,31) + d ( 3, 4, 11,12,19 )
A=0
DE
BC
00
01
00
11
10
01
11
10
DE
BC
00
00
A=1
01
11
0
01
0
x
x
0
11
10
10
0
0
F= ( A + C + D ) ( B + D + E ) ( A + B + C + E ) ( A+ B + C + E )
( A
A + C + D + E
E ) ( A
A + B + C
C + D
D ) ( A
A + B
B +C+E)
54
Tabulation Method (or)

Quine McCluskey Method
Simplify the following boolean function by using the tabulation method
F = ( 0,1,2,8,10,11,14,15 )
(b)
w x
(a)
wxyz
0
0000
1
2
8
0001
0010
1000
10
1010
11
14
15
1011
1110
1111
0,1
0,2
0,8
0 0 __ 0
__ 0 0 0
2,10
8,10
10,11
10,14
11,15
14,15
0 0
__ 0
1 0
1 0
1 __
1 __
1 1
((c )
w x
z
__
1 0
__ 0
1 __
1 0
1 1
1 __
0,2,8,10
__ 0 __ 0
0 8 2 10
0,8,2,10
__ 0 __ 0
10,11,14,15
__
1 __
10,14,11,15
1 __
1 __

F= w
w x
x y
y + x
x z
z + w y
55
Simplify the following Boolean function by using the tabulation method

F = ( 0,1,2,8,10,11,14,15 )
(a)
(b)
(c )
wxyz
0
0000
0001
0010
1000
10
1010
0,1
(1)
0,2
(2)
0,8
(8)
2,10
(8)
8,10
(2)
10,11
(1)
10,14
(4)
11,15
14,15
(4)
(1)
11
1011
14
1110
15
1111
0,2,8,10
( 2, 8)
0,8,2,10
, , ,
( 2,8)
, )
10,11,14,15
(1, 4 )
10,14,11,15
0
(1,
( 4))
F= w x y + x z + w y

56
Determine the prime-implicants , essential prime implicants and simplified

expression
F( w,x,y,z) = (1,4,6,7,8,9,10,11,15 )
(a)
(b)
(c )
wxyz
1
0001
0100
1000
0110
9
10
1001
1010
1,9
(8)
8,9,10,11
( 1, 2 )
4,6
(2)
8,10,9,11
, , ,
( 2,1)
, )
8,9
(1)
8,10
(2)
67
6,7
(1)
9,11
(2)
10,11
(1)
0111
11
1011
15
1111
7,15
(8)
11,15
(4)

57
The prime implicants consist of all the unchecked terms in the table
The prime implicants are x y z, w x z, w x y, x y z, w y z, and w x
prime-implicant table
1,9
x y z
4,6
w x z
67
6,7
w
w x y
7,15 x y z
10
X
X
X
X
X
X
11,15 w y z
11 15
X
X
89 0
8,9,10,11
w x
The
e prime
p
e implicants
p ca ts tthat
at cover
co e minterms
te s with
t a single
s g e cross
c oss in their
t e
column are called essential prime implicants .
x y z
, w x z and w x
Simplified expression F= x y z + w x z + w x + x y z
58

expression
F( A,B,C,D,E) = (0,1,4,5,6,7,12,18,19,22,23,28,31)
(a)
ABCDE
00000
00001
00100
00101
6
12
00110
01100
18
7
19
22
28
10010
00111
10011
10110
11100
23
10111
31
11111
(b)
(c )
0,1
,
0,4
(1)
( )
(4)
1,5
,
4,5
4,6
4,12
(4)
(1)
( )
(2)
(8)
P1
5,7
,
(2)
( )
6,7 (1)
6,22 (16)
12,28 (16) P2
18,19 (1)
18,22 (4)
7,23 (16)
19,23
(4)
22,23 (1)
23,31 (8)
0,1,4,5
( 1, 4 )
0,4,1,5 ( 4, 1 )
P4
4,5,6,7
, , ,
4,6,5,7
P5
( 1,, 2))
( 2, 1 )
6,7,22,23
6,22,7,23
( 1, 16 )
( 16, 1 )
P6
18,19,22,23 ( 1, 4 )
18,22,19,23
P7
( 1, 4 )
P3
59
The prime implicants are ACDE , BCDE , ACDE , ABD , ABC , BCD , ABD
0 1
23 31 ACDE
23,31
0,1,4,5 ABD
4,12 ACDE
12,28 BCDE
4,5,6,7 ABC
6 22 23 BCD
6,7,22,23
C
18,19,22,23 ABD
12 18 19 22
23 28
31
X
X
X
X
X X X X
X X X X
X X
Essential prime implicants ABD + ABD + ACDE + BCDE

Simplified expression
F= ABD + ABD + ACDE + BCDE + ABC (or) BCD
60

expression
F = (1,2,12,13,15,17,18,19,20,21,23,24,25,27,29,31)
1
2
(a)
ABCDE
00001
00010
12
17
18
01100
10001
10010
20
24
10100
11000
13
19
21
25
01101
10011
10101
11001
15
23
27
29
01111
10111
11011
11101
31
11111
(b)
(c )
1,17 (16)
2 18 (16)
2,18
12,13 (1)
17,19 (2)
17,21 (4)
,
(8)
( )
17,25
18,19 (1)
20,21 (1)
24,25 (1)
13,15
,
13,29
19,23
19,27
21,23
21,29
25,27
25,29
15,31
23,31
27,31
29,31
P1
P2
P3
P5
P6
(2)
( )
(16)
(4)
(8)
(2)
(8)
(2)
(4)
(16)
(8)
(4)
(2)
17,19,21,23
17,19,25,27
17,21,19,23
17,21,25,29
, , ,
17,25,19,27
17,25,21,29
13,15,29,31
19,23,27,31
21 23 29 31
21,23,29,31
25,27,29,31
25,29,27,31
(d)
17 19 21 23
17,19,21,23
25,27,29,31
17,19,25,27
21 23 29 31
21,23,29,31
17,21,25,29
19,23,27,31
( 2, 4 )
( 2, 8 )
( 4, 2)
( 4,, 8 )
( 8, 4 )
( 8, 4 )
( 2, 16 ) P7
( 4, 8 )
( 2,
2 8)
( 2, 4 )
( 4, 2 )
( 2,
2 4 ,8)
8)
P8
( 2, 8 ,4)
( 4, 8,2 )
61
The prime implicants are BCDE, BCDE, ABCD, ABCD, ABCD, ABCD, BCE, AE
prime-inmplicant table
1 2 12 13 15 17 18 19 20 21
1,17 BCDE
2,18 BCDE
12 13 A
12,13
ABCD
BCD
23 24
29
31
X
X
X
X
X
X
20,21 ABCD
X
X
2 2 ABCD
24,25
C
17,19,21,23
25,27,29,31 AE
27
18,19 ABCD
13,15,29,31BCE
25
X
X
Essential prime implicants and Simplified expression

F= BCDE + BCDE + ABCD + ABCD + ABCD + BCE +AE
62

expression
F ( w,x,y,z)= (1,3,4,5,9,10,11) + ( 6,8 )
(a)
(b)
(c )
wxyz
1
0001
0100
1000
0011
0101
0110
1001
10 1 0 1 0
11
1011
1,3
(2)
1,5
(4)
P1
1,9
(8)
4,5
(1)
P2
46
4,6
(2)
P3
8,9
(1)
8,10 (2)
3,11 (8)
9,11 (2)
10 11 (1)
10,11
1,3,9,11
( 2, 8)
1,9,3,11
( 8,2)
8,9,10,11 ( 1,2)
8,10,9,11 ( 2,1)
P4
P5

63
The prime implicants are w y z , w x y, w x z, x z, w x
1,5
wyz
4,5
w x y
10 11
X
X
4,6
4
6 w
w x z
z
1,3,9,11 x z
X
X
X
X
8,9,10,11 w x
X
X
The
e prime
p
e implicants
p ca ts tthat
at cover
co e minterms
te s with
t a single
s g e cross
c oss in their
t e
column are called essential prime implicants . x z , w x
Simplified expression F = x z + w x + w x y

64

expression
F ( w,x,y,z)= (2,3,4,7,9,11,12,13,14) + ( 1,10,15 )
(a)
(b)
(c )
wxyz
1
2
4
0001
0010
0100
10 1 0 1 0
12 1 1 0 0
7 0111
11 1 0 1 1
13 1 1 0 1
14 1 1 1 0
15 1 1 1 1
3
9
0011
1001
1,3 (2)
1,9 (8)
2,3
(1)
,
(8)
( )
2,10
4,12 (8)
3,7 (4)
3 11 (8)
3,11
9,11 (2)
9,13 (4)
10,11 (1)
10 14 (4)
10,14
12,13 (1)
12,14 (2)
7,15 (8)
11 15 (4)
11,15
13,15 (2)
14,15 (1)
1,3,9,11
( 2, 8)
1,9,3,11
( 8,2)
2,3,10,11 ( 1,8)
2,10,3,11 ( 8,1)
3,7,11,15 ( 4, 8)
3
3,11,7,15 ( 4, 8)
9,11,13,15 ( 4, 2)
9 13 11 15 ( 4,
9,13,11,15
4 2)
10,11,14,15
( 1, 4)
10,14,11,15
( 1, 4)
12,13,14,15
( 1, 2)
12,14,13,15
( 1, 2)
65
The prime implicants are B C D , BD, BC, CD,AD,AC,AB
4,12 B C D
1,3,9,11 BD
2,3,10,11
2
3 10 11 B
BC
C X
3,7,11,15 CD
9,11,13,15 AD
12
13
14
X
X
X
X
X
X
10,11,14,15
10
11 14 15
AC
12,13,14,15
AB
11
Essential primeimplicants BC , BCD,CD

Simplified expression F = BC + BCD+CD +AB + AD
66

expression
F = (8,12,13,18,19,21,22,24,25,28,31) + d ( 1,2,3,6,7,11 )
1
2
8
3
6
12
(a)
ABCDE
00001
00010
01000
00011
00110
01100
18
24
10010
11000
00111
11
13
19
21
22
25
28
01011
01101
10011
10101
10110
11001
11100
31
11111
(b)
1,3
23
2,3
2,6
2,18
8,12
8 24
8,24
(c )
(2)
(1)
(4)
(16)
(4)
(16)
3,7 (4)
3,11 (8)
P1
P2
(1)
(16)
P3
2367
2,3,6,7
( 1,
1 4)
P9
( 1, 16 )
P10
2,3,18,19
2,6,3,7
, , ,
( 4,, 1 )
P4
P5
2,6,18,22 ( 4, 16 )
3,19
,
(16)
( )
2,18,3,19
( 16, 1 )
6,7
6,22
2,18,6,22
( 16, 4 )
8,12,24,28 ( 4, 16 )
12 13 (1)
12,13
P6
12,28 (16)
P7
18,19
18 22
18,,22
24,25
24,28
(1)
(4)
(1)
(4)
P11
8,24,12,28
P12
( 16, 4 )
P8
67
The prime implicants are ABCDE, ABCDE, ABCE, ABDE, ACDE,ABCD,

BCDE, ABCD,ABD,BCD,BDE,BDE
prime-implicant
p
p
table
8 12 13 18 19 21 22 24 25 28
31
21 ABCDE
31 ABCDE
1,3 ABCE
3,7 ABDE
3,11 ACDE
12 13 A
12,13
ABCD
BCD
12,28 BCDE
24,25 ABCD
X
X
2,3,6,7 ABD
2,3,18,19 BCD
2,6,18,22 ,BDE
8,12,24,28 BDE
X X
68
The prime implicants that cover minterms with a single cross in their
column are called essential prime implicants .
Essential prime implicants are ABCDE, ABCDE,ABCD, ABCD,BCD, BDE
p
expression
p
Simplified
ABCDE + ABCDE + ABCD + ABCD+ BCD+ BDE + BDE

69
NAND Implementation
ABC
A +B+C
ABC
Implement the following function in two level NAND F=

F AB+CD
A
B
A
B
F
C
D
F
C
D
70
Implement the following function in two level NAND F= x y + x y + z
x
y
x
y
z
x
y
x
y
F
F
x
y
z
x
y
z
Implement the following function in two level NAND

71
Multi level NAND Implementation

Implement the following function in multi level NAND
F = ABC + ABC + ABD + AB D
= (AB+AB)(C+D)
72
Implement the following function in multi level NAND f = a'c'd+bc'd+bcd'+acd'

= c'd(a'+b)+cd'(a+b)
level 3
level 2
level 1

73
Implement the following function in multi level NAND f = (AB+C)(D+E+FG) + H
level 4
level 3
level 2
level 1

74
NOR Implementation
Two level NOR Implementation
A NOR gate equivalent logic gate
A+B+C
ABC =
A+B+C
Implement the following function in two level NOR F= ( A + B ) ( C + D)

75
Implement the following function in multi level NOR f = a'c'd+bc'd+bcd'+acd'

= c'd(a'+b)+cd'(a+b)
level 4
level 3
level 2

level 1
76
Implement the following function in multi level NOR f = (AB+C)(D+E+FG) + H
level
e e 5
level
e e 4
level 3
level 2

level 1
77

Digital Logic Design For Boolen Algebra

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Digital Logic Design For Boolen Algebra

Загружено:

Авторское право:

Доступные форматы

Boolean Algebra

Boolean Expressions and Theorems:

De- Morgans Law :

EC214 Digital Logic Design

Simplify the given boolean expression

f = xyz + xyz + xyz + xyz

Simplify the given boolean expression

f = ABC + ABC + AB + ABC + ABC

Simplify the given boolean expression

Simplify the given boolean expression

f = ( A+ B)(AC + C)(B. AC)

Simplify the given boolean expression

EC214 Digital Logic Design

EC214 Digital Logic Design

EC214 Digital Logic Design

The NAND and NOR gates are universal gates.

EC214 Digital Logic Design

NAND Gate is a Universal Gate

Implementing AND Gate Using only NAND Gates

Implementing OR Gate Using only NAND Gates

EC214 Digital Logic Design

Implementing EX-OR Gate Using only NAND Gate

Implementing EX-NOR Gate Using only NAND Gate

EC214 Digital Logic Design

NOR Gate is a Universal Gate

Implementing OR Gate Using only NOR Gates

Implementing AND Gate Using only NOR Gates

EC214 Digital Logic Design

Implementing EX-NOR Gate Using only NOR Gate

Implementing EX-OR Gate Using only NOR Gate

EC214 Digital Logic Design

Minterms & Maxterms

Boolean functions expressed as a sum of minterms or product of maxterms

Example: Express the Boolean function F= x y + x z in a product of maxterm

EC214 Digital Logic Design

Express the function Y= A + B C in (a) canonical SOP (b) canonical POS

In 1953, Maurice Karnaugh invented a graphical way of visualizing and then

Sum of-Product (SOP) Form

EC214 Digital Logic Design

Rules for K-map Simplification using Sum of Products Form ( SOP)

Groupings can contain only 1s; no 0s

The groups must be made as large as possible

EC214 Digital Logic Design

Two variable K-map

Simplify the Boolean expression in S O P Y(A,B)= (0, 1, 3)

Simplify the expression Y= ( 0, 2, 3)

EC214 Digital Logic Design

Simplify the boolean expression Y ( A,B)= ( 1, 2 )

Simplify the expression Y(A,B) = ( 0, 1,2, 3, )

Three Variable K-map

Simplify the expression Y ( x

EC214 Digital Logic Design

Simplify the expression Y( A,B,C)= ( 2, 3, 4, 5 )

Simplify the expression f( x, y, z)= ( 0,1,2, 3, 6, 7 )

EC214 Digital Logic Design

Simplify the expression Y(A,B,C)= ( 1, 3, 4, 6 )

Simplify the expression Y= ( 0, 2, 4, 6, 7 )

EC214 Digital Logic Design

Simplify the expression Y= ( 1, 2, 4, 7 )

Simplify the expression (a) P O S (b) S O P f = ( 0, 1, 2, 3, 4, 6 )

Simplify the expression in P O S

Simplify the expression in P O S

EC214 Digital Logic Design