Professional Documents
Culture Documents
Groupings on K-Maps
A BC 00 01 11 10 0 0 0 0 1 1 0 0 0 1 Grouping can be read DIRECTLY as BC by looking at what is COMMON within the circled group.
F(A,B,C) = BC
BR 2/1/99
F(A,B,C) = AB
BC 0 00 1 01 0 11 0 10 1
1 1 0 0 1
F(A,B,C) = B
A BC 00 01 11 10 A BC 00 01 11 10
Multiple Groupings
0 1 1 0 0 1 0 1 0 0 Want to cover all 1s with largest possible groupings. F(A,B,C) = BC + AB
0 0 0 1 1
1 1 0 0 0
Groupings of only a single 1 are ok if larger groupings cannot be found. F(A,B,C) = ABC + AB
BR 2/1/99
A BC 00 01 11 10
Illegal Groupings
0 1 0 0 0 1 0 1 0 0 Illegal Grouping! Minterms are not boolean adjacent! ABC , ABC will NOT reduce to a single product term ABC + ABC = B(AC+AC)
BR 2/1/99
BR 2/1/99
Other Groupings
AB 01 11 10 CD 00 00 1 0 0 1 01 1 0 0 1 11 1 0 0 1 10 1 0 0 1
F (A,B,C,D) = B
BR 2/1/99
BR 2/1/99
F (A,B,C,D) = BD
BR 2/1/99
Some Definitions
A BC 00 01 11 10 0 0 0 1 1 1 1 0 1 1 ABC BC B Prime Implicant: A covering that cannot be combined with some other covering to eliminate a variable.
10
Implicant: Any single 1 or any group of 1s is called an implicant of F. Any possible grouping of 1s is an implicant.
A BC 00 01 11 10
0 0 0 1 1
1 1 0 1 1
AC
B
BR 2/1/99
Minimum SOPs
The minimum SOP expression consists of some (but not necessarily all) of the prime implicants of a function.
If a SOP expression contains a term which is NOT a prime implicant, then it CANNOT be minimum.
BR 2/1/99
11
Prime Implicants
AB CD 00 01 11 10 00 0 1 1 0 01 1 1 1 0 11 1 0 0 0 10 0 0 0 0 EACH of the coverings is a PRIME IMPLICANT. BC , ACD , ABD
Minimum SOP will have some or all of these prime implicants. The included prime implicants must cover all of the ONEs. F(A,B,C,D) = BC + ABD (minimum # of PIs) = BC + ABD + ACD (valid, but not minimum) ABD + ACD (both PIs, but all 1s not included!)
BR 2/1/99 12
F(A,B,C,D) = BC + ABD
(minimum # of PIs)
Prime Implicant ACD is a NON-ESSENTIAL prime implicant because its 1s are covered by other PIs . A PI is ESSENTIAL if it covers a MINTERM that cannot be covered by any other PI.
BR 2/1/99 13
AC
ACD
Recall that a covering is a Prime Implicant if it cannot be combined with another covering to eliminate a variable.
BR 2/1/99 14
Two Solutions
AB CD 00 01 11 10 00 1 1 0 0 01 1 1 0 0 11 0 1 1 1 10 0 0 0 0 AB CD 00 01 11 10 00 1 1 0 0 01 1 1 0 0 11 0 1 1 1 10 0 0 0 0 EACH solution is equally valid. F(A,B,C,D) = AC + ACD + ABD Essential PIs Non-Essential PIs
Minimal Solution
A minimal SOP will consist of prime implicants. A minimal SOP equation will have all of the essential prime implicants on the map. By definition, these cover a minterm that may not be covered by some other prime implicant. The minimal SOP equation may or may not include nonessential prime implicants. It will include non-essential prime implicants if there are 1s remaining that have not been covered by an essential prime implicant.
BR 2/1/99
16
Dont Cares
Row 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 ABCD 00 00 00 01 00 10 00 11 01 00 01 01 01 10 01 11 10 00 10 01 10 10 10 11 11 00 11 01 11 10 11 11 F(A,B,C,D) 0 0 1 1 0 0 1 A 0 B 0 C 0 D x x x x x x
Recall that Dont Cares are labeled as Xs in truth table. Can treat Xs as either 0s or 1s F(ABCD) Recognize BCD numbers: 2,3,6 Non BCD numbers are dont cares because will never be applied as inputs.
BR 2/1/99
17
BC
BR 2/1/99
18
Minimizing 0s
BC 0 00 1 01 0 11 0 10 1 1 1 0 0 1 F(A,B,C) = C Grouping 0s produces an equation for F. F(A,B,C) = C
BR 2/1/99
19
Minimizing zeros, then applying inverse to both sides is a way to get to minimum POS form!!!!!
BR 2/1/99
20