Karnaugh maps provide a visual technique for minimizing Boolean expressions by grouping adjacent 1's. They allow grouping of terms by proximity rather than just algebraic manipulation. Gray codes are used to ensure each pair of adjacent numbers in the map differ by only one bit. The technique involves finding maximal groups of 1's, identifying essential prime implicants, and selecting additional groups to cover all 1's. It can handle don't care conditions and multiple outputs through gate sharing.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online from Scribd
Karnaugh maps provide a visual technique for minimizing Boolean expressions by grouping adjacent 1's. They allow grouping of terms by proximity rather than just algebraic manipulation. Gray codes are used to ensure each pair of adjacent numbers in the map differ by only one bit. The technique involves finding maximal groups of 1's, identifying essential prime implicants, and selecting additional groups to cover all 1's. It can handle don't care conditions and multiple outputs through gate sharing.
Karnaugh maps provide a visual technique for minimizing Boolean expressions by grouping adjacent 1's. They allow grouping of terms by proximity rather than just algebraic manipulation. Gray codes are used to ensure each pair of adjacent numbers in the map differ by only one bit. The technique involves finding maximal groups of 1's, identifying essential prime implicants, and selecting additional groups to cover all 1's. It can handle don't care conditions and multiple outputs through gate sharing.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online from Scribd
Karnaugh maps provide a visual technique for minimizing Boolean expressions by grouping adjacent 1's. They allow grouping of terms by proximity rather than just algebraic manipulation. Gray codes are used to ensure each pair of adjacent numbers in the map differ by only one bit. The technique involves finding maximal groups of 1's, identifying essential prime implicants, and selecting additional groups to cover all 1's. It can handle don't care conditions and multiple outputs through gate sharing.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online from Scribd
Download as ppt, pdf, or txt
You are on page 1/ 38
Karnaugh Maps
Circuit Minimization
Algebraic manipulations can be used to simplify Boolean expressions
As we've seen, this process is not always easy
Karnaugh maps (K-maps) provide an easy and visual technique for finding the minimum cost SOP (or POS) form for a Boolean expression
This technique has limitations. i.e. works for # inputs < 7 Not good for CAD tools, but good for teaching the idea of simplification
The Combining Property
Recall the combining property
x y + x y'
x (y + y')
=x
Example:
f = x1'x2'x3'+x1'x2x3'+x1x2'x3'+x1x2'x3 = m0 + m2 + m4 + m5 Minterms m0 and m2 differ in only one variable (x2)
m0 and m2 can be combined to get x1'x3' Reduced fan in and reduced number of gates
Hence, f = x1'x3' + x1x2'
still SOP but not canonical
Visualizing the Combining Property
f(x1,x2) = m(0,1,3) x1 x2 0 1 0 1 F 1 1 0 1
Canonical SOP:
0 0 1 1
f = x1'x2'+x1'x2+x1x2 = x1'x2'+x1'x2+x1x2+x1'x2 = x1'+x2
A 2-variable Karnaugh map:
x2 x1 0 1
0 1 0
1 1 1 minimum form: f = x1'+x2
3 Variable Map
f(A,B,C) = m(1,2,6,7) BC A 0 00 0 01 1 11 0
Gray Code: any two consecutive numbers differ in only a single bit
10 1
Minimum SOP is f = A B + B C' + A' B' C Cost = gates + fan-in = 4 + (7+3) = 14
K-maps in Various Sizes
B A 0 1 m0 m2 m1 m3 0 1 BC A 0 1 00 m0 m4 01 m1 m5 11 m3 m7 10 m2 m6
CD AB 00 01 11 10
00 m0 m4
01 m1 m5
11 m3 m7
10 m2 m6
m12 m13 m15 m14 m8 m9 m11 m10
Full-Adder Carry-Out
Cout(A,B,Cin) = m(3,5,6,7) B Cin A 0 00 0 01 0 11 1 10 0
Minimum SOP is Cout = A Cin + B Cin + A B Cost = 4 + 9 = 13
More 3 Variable Maps
BC A 0 0 0 1 1 f = A' B + A B'
00
01
11
10
(A B)
BC A 0 1
00 1 0
01 1 0
11 1 1
10 1 1
f = A' + B
And Even More 3 Variable Maps
BC A 0 1 0 1 1 0 1 0 0 1 f = A' C + A C'
00
01
11
10
(A C)
BC A 0 1
00 1 1
01 0 0
11 0 1
10 1 1
f = C' + A B
Full-Adder Sum
S(A,B,Cin) = m(1,2,4,7) B Cin A 0 1 00 0 1 01 1 0 11 0 1 10 1 0
Minimum is S = A B' Cin' + A' B' Cin + A B Cin + A'B Cin' Can't reduce anything and stay in SOP form!
Sidebar: Gray Codes
A binary Gray code is a binary sequence such that no two consecutive numbers differ by more that a single bit Gray codes have many uses in CS
2 bit Gray code: 00, 01, 11, 10 Note that this is circular 10, 00 again differs in only 1 bit These are called binary reflected Gray codes 3 bit Gray code: 000, 001, 011, 010, 110, 111, 101, 100
Constructing Gray Codes
If s0, s1, s2, , s2n is a n bit Gray code, then we can construct an n+1 bit Gray code as follows: 0s0, 0s1, 0s2, , 0s2n, 1s2n, 1s2n-1, 1s2n-2, , 1s1 ,1s0 Example:
00, 01, 11, 10 00, 01, 11, 10 followed by 10, 11, 01, 00 000, 001, 011, 010 followed by 110, 111, 101, 100 Result is 000, 001, 011, 010, 110, 111, 101, 100
The Formal Karnaugh Map Method
1. 2.
Choose a 1 element Find all maximal groups of 1's adjacent to that element
Note: "box" must be a power of 2 in size
3.
4.
Repeat steps 1-2 for all 1 elements Select all boxes for which a 1 is covered by only that box
These boxes are essential!
5.
For all 1's not covered by the essential boxes, select the smallest number of other boxes that cover them
Many times there are incompletely specified conditions
Valuations that can never occur, or for which we dont care what the device does
Modeling such a device requires us to specify dont care conditions in those instances
Use X as a value to indicate we don't care what happens
Don't care situations are often called incompletely specified functions
Example Using Don't Cares
f(A,B,C,D) = m(1,5,8,9,10) + d(3,7,11,15)
CD AB 00 01 11 10 00 0 0 0 1 01 1 1 0 1 11 X X X X 10 0 0 0 1
f = A B' + A' D
Karnaugh Map Method Restated
1. 2.
Choose an element from the on set Find all maximal groups (prime implicants) of on elements and X elements adjacent to that element
Note 1: prime implicants are always a power of 2 in size Note 2: do not feel compelled to include Xs use them only when they provide a larger implicant
3. 4. 5.
Repeat steps 1-2 for all elements in the on set Select all essential prime implicants For all elements of the on set not covered by the essential prime implicants, select the smallest number of prime implicants that cover them
Example: 7 Segment Display
Binary Coded Decimal (BCD) input
4 bit codes: 0000 (0) thru 1001 (9) allowed 4 bit input code should operate lights of a 7 segment display: codes 1010 1111 never occur 7 output signals one for each light a a b g f b g
Y 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 Z 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 a 1 0 1 1 0 1 X 1 1 1 X X X X X X b 1 1 1 1 1 0 0 1 1 1 X X X X X X c 1 1 0 1 1 1 1 1 1 1 X X X X X X d 1 0 1 1 0 1 1 0 1 X X X X X X X e 1 0 1 0 0 0 1 0 1 0 X X X X X X f 1 0 0 0 1 1 1 X 1 1 X X X X X X g 0 0 1 1 1 1 1 0 1 1 X X X X X X
YZ WX 00 01 11 10
00 1 0 X 1
01 0 1 X 1
11 1 1 X X
10 1 X X X
K-map for a
a = W + Y + X'Z' + XZ
Practical 7 Segment Displays
The lights (LEDs) on a real 7 segment display are always active low
When you want to use our design, just invert all the results
9 BCD = 1001 abcdefg = 111x011 becomes 000x100
a f g e d c b
5 Variable K-map
YZ WX 00 01 11 10
00 0 0 1 1
01 0 X 1 1
11 0 1 0 0
10 0 1 X X
YZ WX 00
00 0
01 0
11 1
10 1
01 11 10
0 1 X
0 1 1
X X X
1 X X
V=0
V=1
f = WY' + W'XY + VY
POS Minimization
K-maps can be used for POS minimization, too f(A,B,C) = m(2,3,6)
BC A 0 1 00 0 0 01 0 0 11 1 0 10 1 1
Minimum POS is f = (B)(A' + C') Minimum SOP is f = A'B + BC'
cost = 2 + 4 = 6 cost = 3 + 6 = 9
SOP vs POS Minimization
CD AB 00 01 11 10
00 0 0 1 1
01 1 1 1 1 SOP
11 X X X X
10 0 0 0 1
CD AB 00
00 0
01 1
11 X
10 0
01 11 10
0 1 1
1 1 1
X X X
0 0 1
POS
f = D + AC' + AB' cost = 3 + 7 = 10
f = (A + D)(B' + C') cost = 3 + 6 = 9
Multiple Output Problems
Multiple Output Circuits
Multiple outputs circuits can be designed
using two separate systems, or using one combined system that may share gates
A B C A B C
A B C
F G
Gate Sharing
When there are multiple outputs, gate sharing is sometimes possible
