Professional Documents
Culture Documents
BC
0 0
0 1
1 0
1 1
0 0
0 1
1 0
1 1
F
0
0
0
1
1
1
1
1
BR 2/1/99
A
0
0
0
0
1
1
1
1
BC
0 0
0 1
1 0
1 1
0 0
0 1
1 0
1 1
F
0
0
0
1
1
1
1
1
ABC
ABC
ABC
ABC
ABC
BR 2/1/99
A
0
0
0
0
1
1
1
1
BC
0 0
0 1
1 0
1 1
0 0
0 1
1 0
1 1
F
0
0
0
1
1
1
1
1
POS Form!!
BR 2/1/99
Minterms, Maxterms
We saw that:
F(A,B,C) = ABC + ABC + ABC + ABC + ABC + ABC
SOP form. If a product term has all variables present, it is a
MINTERM.
F(A,B,C) = (A+B+C) (A+B+C)(A+B+C)
POS form. If a sum term has all variables present, it is a
MAXTERM.
All Boolean functions can be written in terms of either Minterms
or Maxterms.
BR 2/1/99
Minterms
ABC = m0
ABC = m1
AB C = m2
AB C = m3
A BC = m4
A BC = m5
A B C = m6
A B C = m7
Maxterms
A+B+C = M0
A+B+C = M1
A+B+C = M2
A+B+C = M3
A+B+C = M4
A+B+C= M5
A+B+C = M6
A+B+C = M7
BR 2/1/99
m6
A
0
0
0
0
1
1
1
1
BC
0 0
0 1
1 0
1 1
0 0
0 1
1 0
1 1
F
0
1
1
0
0
0
1
0
BR 2/1/99
F
0
1
1
0
0
0
1
0
Examples
F(A,B,C,D) = m(0)
= ABCD
(minterm form)
(SOP form)
= M(1,2,3,4,5,6,7,8,9,10,11,12,13,14,15)
(maxterm form)
(POS form too long to write..)
F(A,B) = m(1,2)
= AB + AB
= M(0,3)
= (A+B)(A+B)
= A xor B
(minterm form)
(SOP form)
(maxterm form)
(POS form)
(did you recognize this?)
BR 2/1/99
Minterm Expansion
A minterm must have every variable present. If a boolean
product term does not have every variable present, then it
can be expanded to its minterm representation.
F(A,B,C) = AB + C
neither AB, or C are minterms
To expand AB to minterms, use the relation:
AB = AB(C+ C) = ABC + ABC
To expand C to minterms, do:
C = C(A+A) = AC+ AC = AC(B+B) + AC(B+B)
= ABC + ABC + ABC + ABC
F = AB +C = ABC + ABC + ABC + ABC + ABC
F(A,B,C) =
m(1,3,5,6,7)
BR 2/1/99
10
Maxterm Expansion
A maxterm must have every variable present. If a boolean
sum term does not have every variable present, then it can
be expanded to its maxterm representation.
F(A,B,C) = (A+B) (C)
neither (A+B), or C are maxterms
To expand (A+B) to maxterms, use the relation:
(A+B) = (A+B+CC) = (A+B+C)(A+B+C)
To expand C to minterms, do:
C = C+AA = (A+C)(A+C) = (A+BB+C)(A+C+BB)
= (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)(A+B+C)
F(A,B,C) = M(0,1,2,4,6)
BR 2/1/99
11
BR 2/1/99
12
13
Karnaugh Maps
Karnaugh Maps (K-Maps) are a graphical method
of visualizing the 0s and 1s of a boolean function
K-Maps are very useful for performing Boolean
minimization.
BR 2/1/99
14
K-Maps
A K-map has a square for each 1 or 0 of a boolean function.
One variable K-map has 21 = 2 squares.
Two variable K-map has 22 =4 squares
Three variable K-map has 23 = 8 squares
Four variable K-map has 24 = 16 squares
3 variable
1 variable
2 variable
4 variable
BR 2/1/99
15
Row A
0
0
1
1
F(A)
?
?
A=0 A=1
? ?
Row A
0
0
1
1
F(A)
0
1
A=0 A=1
0 1
F(A) = A
Row A
0
0
1
1
F(A)
1
0
A=0 A=1
1 0
F(A) = A
BR 2/1/99
16
AB
0 0
0 1
1 0
1 1
F(A,B)
?
?
?
?
A
B
0
1
0
?
?
1
?
?
A
B
0
1
0 1
r0 r2
r1 r3
AB
0 0
0 1
1 0
1 1
F(A,B)
0
1
1
1
A
B
0
1
0
0
1
1
1
1
F(A,B) = A + B
BR 2/1/99
17
AB
0 0
0 1
1 0
1 1
F(A,B)
0
1
1
0
Row
0
1
2
3
AB
0 0
0 1
1 0
1 1
F(A,B)
0
0
0
1
A
B
0
1
A
B
0
1
0
0
1
1
1
0
0
0
0
1
BR 2/1/99
F(A,B) = AB + AB
F(A,B) = AB
18
ABC
0 00
0 01
0 10
0 11
1 00
1 01
1 10
1 11
A
BC
00
01
11
F(A,B,C)
?
?
?
?
?
?
?
?
10
1
?
?
?
?
0
?
?
?
?
A
BC
00
01
11
0 1
r0 r4
r1 r5
r3 r7
10
r2 r6
BR 2/1/99
19
Boolean Adjacency
Note on the three variable map:
A
BC
00
01
11
10
0
r0
r1
r3
r2
A
BC
00
01
10
1
r4
r5
r7
r6
r0
r1
r2
11 r3
1
r4
r5
r6
r7
WRONG!!!
Correct
Each square on the 3-variable map is Boolean Adjacent. Adjacent
squares only differ by ONE BOOLEAN VARIABLE!!!
BR 2/1/99
20
Boolean Adjacency
A
1
BC 0
00 f(ABC) f(ABC)
01 f(ABC) f(ABC)
11 f(ABC)
f(ABC)
10 f(ABC)
f(ABC)
BR 2/1/99
21
ABC
0 00
0 01
0 10
0 11
1 00
1 01
1 10
1 11
F(A,B,C)
1
0
1
0
0
0
1
0
A
BC
00
01
11
10
0
1
0
0
1
1
0
0
0
1
F(A,B,C) = m(0,2,6)
BR 2/1/99
22
ABC
0 00
0 01
0 10
0 11
1 00
1 01
1 10
1 11
F(A,B,C)
0
0
0
0
1
1
1
0
A
BC
00
01
11
10
0
0
0
0
0
1
1
1
0
1
F(A,B,C) = m(4,5,6)
BR 2/1/99
23
A BCD
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)
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
AB
01 11 10
CD 00
00 ? ? ? ?
01 ? ? ? ?
11 ? ? ? ?
10 ? ? ? ?
AB
CD 00
00 r0
01 r1
11 r3
10
BR 2/1/99
01 11 10
r4 r12 r8
r5 r13 r9
r7 r15 r11
r2 r6 r14 r10
24
Boolean Adjacency
AB
01
00
CD
00 f(ABCD) f(ABCD)
01 f(ABCD) f(ABCD)
11 f(ABCD)
f(ABCD)
10
f(ABCD)
f(ABCD)
11
10
f(ABCD)
f(ABCD)
f(ABCD)
f(ABCD)
f(ABCD)
f(ABCD)
f(ABCD)
f(ABCD)
25
A BCD
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
AB
1
CD 00 01 11
1
00 0 0 0
0
01 0 0 0
0
1
11 1 0 1
0
0
10 1 1 0
0
1
F = m(2,3,6,10,15)
0
0
0
0
1
10
0
0
0
1
BR 2/1/99
26
BR 2/1/99
27