Scribd
Upload
6 views

lecture_11_K_maps4

The document covers advanced topics in Digital Logic Design, specifically focusing on Karnaugh Maps for four and five variables. It includes detailed examples of minterm locations, the determination of minimum Sum of Products (SOP) and Product of Sums (POS) forms, and practical applications related to BCD codes. The lecture aims to enhance understanding of grouping techniques in Karnaugh Maps for simplifying logic expressions.

Uploaded by

Tilahun Eirku
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views

lecture_11_K_maps4

The document covers advanced topics in Digital Logic Design, specifically focusing on Karnaugh Maps for four and five variables. It includes detailed examples of minterm locations, the determination of minimum Sum of Products (SOP) and Product of Sums (POS) forms, and practical applications related to BCD codes. The lecture aims to enhance understanding of grouping techniques in Karnaugh Maps for simplifying logic expressions.

Uploaded by

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

DLD 200 Digital Logic Design

More Karnaugh Maps

Monday, February 02 DLD 200 Digital Logic Design Slide 1 of 11


Chapter in textbook 4

CLOs 2

Friday, January 9 ENDD 200 Digital Logic Design Slide 2 of 16


Lecture Outline

• Four Variable Karnaugh Maps


• Five Variable Karnaugh Maps

Monday, February 02 DLD 200 Digital Logic Design Slide 3 of 11


Four Variable Karnaugh Maps

• Minterm locations for a 4-variable K-map

AB
CD 00 01 11 10
00
0 4 12 8
01
1 5 13 9
11
3 7 15 11
10
2 6 14 10

Monday, February 02 DLD 200 Digital Logic Design


Four Variable Karnaugh Maps

• Minterm locations for a 4-variable K-map

AB
CD 00 01 11 10
00
0 4 12 8
01
1 5 13 9
11
3 7 15 11
10
2 6 14 10

Monday, February 02 DLD 200 Digital Logic Design Slide 5 of 11


Four Variable Karnaugh Maps

• Minterm locations for a 4-variable K-map

AB
CD 00 01 11 10
00
0 4 12 8
01
1 5 13 9
11
3 7 15 11
10
2 6 14 10

Monday, February 02 DLD 200 Digital Logic Design


Four Variable Karnaugh Maps

• Minterm locations for a 4-variable K-map

AB
CD 00 01 11 10
00
0 4 12 8
01
1 5 13 9
11
3 7 15 11
10
2 6 14 10

Monday, February 02 DLD 200 Digital Logic Design


Four Variable Karnaugh Maps

• Minterm locations for a 4-variable K-map

AB
CD 00 01 11 10
00
0 4 12 8
01
1 5 13 9
11
3 7 15 11
10
2 6 14 10

Monday, February 02 DLD 200 Digital Logic Design


Four Variable Karnaugh Maps

• Minterm locations for a 4-variable K-map

AB
CD 00 01 11 10
00
0 4 12 8
01
1 5 13 9
11
3 7 15 11
10
2 6 14 10

Monday, February 02 DLD 200 Digital Logic Design


Four Variable Karnaugh Maps

• Minterm locations for a 4-variable K-map

f  ACD  AB
AB  D
AB
CD 00 01 11 10 AB
CD 00
00 01
01 11
11 10
10
00
0 4 12 8 00
00 1 1 1 1
01
1 5 13 9 01
01 1
11
3 7 15 11 11
11 1 1 1
10
2 6 14 10 10
10 1 1 1 1

Is this the minimum SOP form?


Monday, February 02 DLD 200 Digital Logic Design Slide 10 of 11
Four Variable Karnaugh Maps

• Determine the minimum SOP Form of f

f  m(1,3, 4,5,10,12,13)
AB
CD 00 01 11 10
00 1 1
0 4 12 8
01 1 1 1
1 5 13 9
11 1
3 7 15 11
10 1
2 6 14 10

f BC  ABD  ABCD


Monday, February 02 DLD 200 Digital Logic Design Slide 11 of 11
Four Variable Karnaugh Maps

• Determine the minimum SOP Form of f


f  m(0, 2,3,5, 6, 7,8,10,11,14,15)
AB
CD 00 01 11 10
00 1 1
0 4 12 8
01 1
1 5 13 9
11 1 1 1 1
3 7 15 11
10 1 1 1 1
2 6 14 10

f C  BD  ABD

Monday, February 02 DLD 200 Digital Logic Design Slide 12 of 11


Four Variable Karnaugh Maps

• Determine the minimum SOP Form of f


f  m(1,3,5, 7,9)  d (6,12,13)
AB
CD 00 01 11 10
00 X
0 4 12 8
01 1 1 X 1
1 5 13 9
11 1 1
3 7 15 11
10 X
2 6 14 10

f  AD  CD

Monday, February 02 DLD 200 Digital Logic Design Slide 13 of 11


Four Variable Karnaugh Maps

• Determine the minimum POS Form of f


f f
AB AB
CD 00 01 11 10 CD 00 01 11 10
00 1 1 0 1 00 0 0 1 0

01 0 0 0 0 01 1 1 1 1

11 1 0 1 1 11 0 1 0 0

10 1 0 0 1 10 0 1 1 0

f CD  ABC  ABD


f C  D  A  B  C  A  B  D 
Monday, February 02 DLD 200 Digital Logic Design Slide 14 of 11
Four Variable Karnaugh Maps

• The inputs A,B,C,D represent an 8-4-2-1


BCD digit. The output should be 1 iff the
input is exactly divisible by three
Z  m(0,3, 6,9)  d (10,11,12,13,14,15)
AB
CD 00 01 11 10
00 1 0 X 0
0 4 12 8
01 0 0 X 1
1 5 13 9
11 1 0 X X
3 7 15 11
10 0 1 X X
2 6 14 10

Z  ABCD  BCD  AD  BCD


Monday, February 02 DLD 200 Digital Logic Design Slide 15 of 11
Four Variable Karnaugh Maps
Five Variable K-maps

• Five Variable K-Maps (A, B, C, D, E)


 Can also form groupings “vertically”

f f
BC BC
DE 00 01 11 10 DE 00 01 11 10
00 1 00 1

01 1 1 1 01 1
A 0 A 1
11 1 11

10 10

f BCDE 
Monday, February 02 DLD 200 Digital Logic Design Slide 16 of 11
Karnaugh Maps
An Example From CEC 222 Lab 4

• BI must be “0” for all invalid


D3 D2 D1 D0 BI
BCD codes 0 0 0 0
0 0 0 1
D3 D2 0 0 1 0
0 0 1 1
00 01 11 10 0 1 0 0
D1 D0
0 1 0 1
00 0 1 1 0
0 4 12 8 0 1 1 1
01 1 0 0 0
1 5 13 9 1 0 0 1
BI = 11 1 0 1 0
3 7 15 11
1 0 1 1
1 1 0 0
10 1 1 0 1
2 6 14 10 1 1 1 0
1 1 1 1

Implement using NOR gates


Monday, February 02 DLD 200 Digital Logic Design Slide 17 of 11

You might also like