Scribd
Upload
2 views

Module 3

The document provides an overview of the K-Map method for simplifying logic functions, covering two to five variable K-Maps and their applications. It explains the complexity of five-variable K-Maps and illustrates the adjacency of minterms in the context of logic functions. Additionally, it includes examples of simplifying functions using K-Maps and obtaining minimal sums of products.

Uploaded by

gnanadeepak934
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

Module 3

The document provides an overview of the K-Map method for simplifying logic functions, covering two to five variable K-Maps and their applications. It explains the complexity of five-variable K-Maps and illustrates the adjacency of minterms in the context of logic functions. Additionally, it includes examples of simplifying functions using K-Maps and obtaining minimal sums of products.

Uploaded by

gnanadeepak934
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

Module 3

Contents
• The K-Map method,
• two variable K-Map,
• three variable K-Map,
• four variable K- Map,
• five variable K Map,
• K-Maps with don’t care conditions (incompletely specified functions),
Gate Level Minimization
Two variable function in K-map
Three Variable K-map
Four Variable K-map
*
Simplify using K maps F(A,B,C,D) =
∑(7,9,,10,11,12,13,14,15)
C’D’ C’D CD CD’

A’B
’

A’B

AB

AB’

9
*
Simplify using K maps F(A,B,C,D) = ∑(0,3,4,7,8,11,
12,13,15)
C’D’ C’D CD CD’

A’B
’

A’B

AB

AB’

10
*
F(A,B,C,D) = ∑( m0, m1, m2, m4, m5, m6, m8,
m9, m10, m12, m13 )
C’D’ C’D CD CD’

A’B
’

A’B

AB

AB’

11
FIVE-VARIABLE KARNAUGH

*
MAPS
• Karnaugh maps with more than four variables are not simple to use.
• The number of cells or squares becomes excessively large and combining
the adjacent squares becomes complex.
• The number of cells or squares is always equal to the number of
minterms.
• A five-variable Karnaugh map contains 32 cells, which are used to
simplify any five-variable logic function.

12
*
• It consists of 2 four variable maps with variables A,B,C,D and E
• Variable A distinguishes between the two maps
• A= 0; A=1

13
*
A=0

BC DE 00 01 11 10
00 m0 m1 m3 m2

01 m4 m5 m7 m6

11 m12 m13 m15 m14

10 m8 m9 m11 m10

14
*
A=1

BC DE 00 01 11 10
00 m16 m17 m19 m18

01 m20 m21 m23 m22

11 m28 m29 m31 m30

10 m24 m25 m27 m26

15
*
Minterms 0 through 15 with A=0 Minterms 16 through 31 with A=1

Each variable map retains the previously defined adjacency when taken separately.
Each square in the A=0 map is adjacent to the corresponding square in the A=1 map.
Minterm 4 is adjacent to minterm 20
Minterm 15 is adjacent to minterm 20

16
*
17
*
18
*
• Obtain the minimal sum of the products for the function
F (A, B, C, D, E) = Σ (0, 2, 4, 6, 9,13,21, 23, 25, 29, 31)

D’E’ D’E DE DE’ D’E’ D’E DE DE’


A’B’ 0 1 3 2 A’B’ 16 17 19 18

A’B 4 5 7 6 A’B 20 21 23 22

AB 12 13 15 14 AB 28 29 31 30

AB’ 8 9 11 10 AB’ 24 25 27 26

19
*
F (A,B,C,D,E) = ∑ ( m0, m2, m5, m7, m8, m10, m16, m21,
m23, m24, m27, m31 )

F = A̅C̅E̅ + C̅D̅E̅ + B̅CE + ABDE

20

You might also like