Scribd
Upload
2K views15 pages

5 Variable K-Map

To summarize: 1. Two 5-variable K-maps are needed, one for E=0 and one for E=1. 2. The minterms are plotted on the K-maps and grouped to find the essential prime implicants. 3. The groupings yield the terms A'B'D'+AD'E+B'C'D' for the Boolean function F(A,B,C,D,E).

Uploaded by

Ben Sewell
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
2K views15 pages

5 Variable K-Map

To summarize: 1. Two 5-variable K-maps are needed, one for E=0 and one for E=1. 2. The minterms are plotted on the K-maps and grouped to find the essential prime implicants. 3. The groupings yield the terms A'B'D'+AD'E+B'C'D' for the Boolean function F(A,B,C,D,E).

Uploaded by

Ben Sewell
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 15

5 Variable K-Map

How many k-map is needed?

 If you have 5 variables, you’ll need 2 k-map…


 Let’s say the variables are A, B, C, D and E.

CD
AB 00 01 1 1 10
0 1 3 2
00
01 4 5 7 6

E=0 11 12 13 15 14

10 8 9 11 10
How many k-map is needed?

CD
AB 00 01 1 1 10
0 1 3 2
00
01 4 5 7 6

E=1 11 12 13 15 14

10 8 9 11 10
Try this out…
 Simplify the Boolean function F(A,B,C,D,E) =
(0,1,4,5,16,17,21,25,29)
Soln: F(A,B,C,D,E) = A’B’D’+AD’E+B’C’D’
1st step – convert the minterm
into Boolean equation
 F(A,B,C,D,E) = (0,1,4,5,16,17,21,25,29)
 How to convert … ??

 0 = 00000  ABCDE
 1 = 00001  ABCDE
1st step – convert the minterm
into Boolean equation
 F(A,B,C,D,E) = (0,1,4,5,16,17,21,25,29)

F  A BCDE  A BCDE  A BCDE 


A BCDE  A BCDE  A BCDE 
A BCDE  ABCDE  ABC DE
2nd – prepare 2 k-map

CD CD
AB 00 01 1 1 10 AB 00 01 1 1 10
00 00
01 01
11 11
10 10

E=0 E=1
3rd- plug in the Boolean
term/minterm into k-map

CD CD
AB 00 01 1 1 10 AB 00 01 1 1 10
00 1 1 00 1 1
01 01
11 11
1 1
10 1 10
1 1

E=0 E=1
4th- look for similar grouping
that can be done in both k-map

CD CD
AB 00 01 1 1 10 AB 00 01 1 1 10
00 1 1 00 1 1
01 01
11 11
1 1
10 1 10
1 1

E=0 E=1

That will give us A BD


4th- look for similar grouping
that can be done in both k-map

CD CD
AB 00 01 1 1 10 AB 00 01 1 1 10
00 1 1 00 1 1
01 01
11 11
1 1
10 1 10
1 1

E=0 E=1

That will give us BCD


The combination will look like
this…

CD CD
AB 00 01 1 1 10 AB 00 01 1 1 10
00 1 1 00 1 1
01 01
11 11
1 1
10 1 10
1 1

E=0 E=1

That will give us ABD  BCD


5th- look for the remaining 1’s
that has not been included yet

CD CD
AB 00 01 1 1 10 AB 00 01 1 1 10
00 1 1 00 1 1
01 01
11 11
1 1
10 1 10
1 1

E=0 E=1
6th- group the remaining 1’s

CD CD
AB 00 01 1 1 10 AB 00 01 1 1 10
00 1 1 00 1 1
01 01
11 11
1 1
10 1 10
1 1

E=0 E=1
That new grouping will give us A DE
Note that this time, E need to be
included in the term, since the grouping
is in the E = 1 k-map only.
6th- group the remaining 1’s

CD CD
AB 00 01 1 1 10 AB 00 01 1 1 10
00 1 1 00 1 1
01 01
11 11
1 1
10 1 10
1 1

E=0 E=1
Full expression will be,

F  ABD  BCD  ADE

You might also like