بهينه سازي با نقشة کارنو
DESCRIPTION
بهينه سازي با نقشة کارنو. Karnaugh Map. A. 0. 1. A. B. AB. 00. 01. 11. 10. CD. 0. 0. 2. 00. 0. 4. 12. 8. 1. 1. 3. 01. 1. 5. 13. 9. D. A. AB. 11. 3. 7. 15. 11. C. 00. 01. 11. 10. C. 10. 0. 2. 6. 14. 10. 0. 2. 6. 4. B. 1. 1. 3. 7. 5. B. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/1.jpg)
بهينه سازي با نقشة کارنو
Karnaugh Map
![Page 2: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/2.jpg)
2
Karnaugh Map
Method of graphically representing the truth table that helps visualize adjacencies
2-variableK-map
3-variableK-map
4-variableK-map
A B 0 1
0
1
0
1
2
3
0
1
2
3
6
7
4
5
AB C
0
1
3
2
4
5
7
6
12
13
15
14
8
9
11
10
A
B
AB
CD
A
00 01 11 10
0
1
00 01 11 10
00
01
11
10 C
B
D
![Page 3: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/3.jpg)
3
Karnaugh Map
One cell (in K-map) = a row (in truth table) one cell = a minterm (or a maxterm) Multiple-cell areas = standard terms
A B 0 1
0
1
0
1
2
3
0
1
2
3
6
7
4
5
AB C
0
1
3
2
4
5
7
6
12
13
15
14
8
9
11
10
A
B
AB
CD
A
00 01 11 10
0
1
00 01 11 10
00
01
11
10 C
B
D
![Page 4: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/4.jpg)
4
Karnaugh Map
0
1
2
3
6
7
4
5
AB C
A
B
00 01 11 10
0
1
f1(A,B,C) = m1 + m2 + m4 + m6
= A’B’C + A’BC’ + AB’C’ + ABC’
A B C f1
0 0 0 m0 00 0 1 m1 10 1 0 m2 10 1 1 m3 01 0 0 m4 11 0 1 m5 01 1 0 m6 11 1 1 m7 01
1 1 10
0 0 0
![Page 5: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/5.jpg)
5
Karnaugh Map
Numbering Scheme: 00, 01, 11, 10
Gray Code - only a single bit changes from code word to next code word.
A B 0 1
0
1
0
1
2
3
0
1
2
3
6
7
4
5
AB C
0
1
3
2
4
5
7
6
12
13
15
14
8
9
11
10
A
B
AB
CD
A
00 01 11 10
0
1
00 01 11 10
00
01
11
10 C
B
D
![Page 6: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/6.jpg)
6
Two-Variable Map (cont.)
Any two adjacent cells in the map differ by ONLY one variable, which appears complemented in one cell and uncomplemented in the other.
• Example:m0 (=A’B’) is adjacent to m1 (=A’B) and m2
(=AB’) but NOT m3 (=AB) A
B 0 1
0
1
0
1
2
3
![Page 7: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/7.jpg)
7
Karnaugh Map
Adjacencies in the K-Map
Wrap from first to last column
Top row to bottom row
000
001
010
01 1
1 10
1 1 1
100
101
00 01 11 10
0
1
AB C
A
B
![Page 8: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/8.jpg)
8
2-Variable Map -- Example f(x1,x2) = x1’x2’+ x1’x2 + x1x2’
= m0 + m1 + m2
1s placed in K-map for specified minterms m0, m1, m2
Grouping (ORing) of 1s allows simplification
What (simpler) function is represented by each dashed rectangle?m0 + m1 = x1’x2’+ x1’x2 =
x1’(x2’+ x2 ) = x1’ m0 + m2 = x1’x2’+ x1x2’ =
x2’(x1’+ x1 ) = x2’
Note m0 covered twice
x2 0 1
0 1 1
1 1 0
x1
0 2
1 3
![Page 9: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/9.jpg)
9
Minimization as SOP using K-map
Enter 1s in the K-map for each product term in the function
Group adjacent K-map cells containing 1s to obtain a product with fewer variables. Groups must be in power of 2 (2, 4, 8, …)
Handle “boundary wrap” Answer may not be unique
![Page 10: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/10.jpg)
10
Minimization as SOP
F = ?
A asserted, unchangedB varies
Cout = ? F(A,B,C) = ?
A
B 0 1
0 1
0 1
0
1
G = ?
B complemented, unchangedA varies
A
B 0 1
1 1
0 0
0
1
A B A
B
Cin 00 01 11 10
0
1
0
0
0
1
1
1
0
1
AB C
A
00 01 11 10
0
1
0
0
0
0
1
1
1
1
B
![Page 11: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/11.jpg)
11
Minimization as SOP
F = A
A asserted, unchangedB varies
Cout = AB + Bcin + ACin F(A,B,C) = A
A
B 0 1
0 1
0 1
0
1
G = B'
B complemented, unchangedA varies
A
B 0 1
1 1
0 0
0
1
A B A
B
Cin 00 01 11 10
0
1
0
0
0
1
1
1
0
1
AB C
A
00 01 11 10
0
1
0
0
0
0
1
1
1
1
B
![Page 12: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/12.jpg)
12
More Examples
F(A,B,C) = m(0,4,5,7)
F =
F'(A,B,C) = m(1,2,3,6)
F' =
F' : simply replace 1's with 0's and vice versa
00 C
AB 01 11 10
1 0 0 1
1 1 0 0
A
B
0
1
00 C
AB
01 11 10
0 1 1 0
0 0 1 1
A
B
0
1
![Page 13: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/13.jpg)
13
More Examples
F(A,B,C) = m(0,4,5,7)
F = B' C' + A C
F'(A,B,C) = m(1,2,3,6)
F' = B C' + A' C
F' simply replaces 1's with 0's and vice versa
00 C
AB 01 11 10
1 0 0 1
1 1 0 0
A
B
0
1
00 C
AB
01 11 10
0 1 1 0
0 0 1 1
A
B
0
1
Why not group m4 and m5?
![Page 14: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/14.jpg)
14
Simplification
Enter minterms of the Boolean function into the map, then group terms
• Example: f(a,b,c) = bc’ + abc + ab’
1 1 1
1 1
cab
1 1 1
1 1
00 01 11 10
0
1
00 01 11 10
0
1 cab
Result: f(a,b,c) = bc’+ a
![Page 15: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/15.jpg)
15
4-Variable MapF(A,B,C,D) = m(0,2,3,5,6,7,8,10,11,14,15)
F =
AB 00 01 11 10
1 0 0 1
0 1 0 0
1 1 1 1
1 1 1 1
00
01
11
10 C
CD
A
D
B
m10m14m6m210
m11m15m7m311
m9m13m5m101
m8m12m4m000
10 11 01 00CD
AB
![Page 16: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/16.jpg)
16
Four-variable Map Simplification
One square represents a minterm of 4 literals.
A rectangle of 2 adjacent squares represents a product term of 3 literals.
A rectangle of 4 squares represents a product term of 2 literals.
A rectangle of 8 squares represents a product term of 1 literal.
A rectangle of 16 squares produces a function that is equal to logic 1.
![Page 17: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/17.jpg)
17
4-Variable Map
F(A,B,C,D) = m(0,2,3,5,6,7,8,10,11,14,15)
F = C + A' B D + B' D'
AB 00 01 11 10
1 0 0 1
0 1 0 0
1 1 1 1
1 1 1 1
00
01
11
10 C
CD
A
D
B
Find the smallest number of the largest possible subcubes that cover the ON-set
![Page 18: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/18.jpg)
18
Simplify for POSK-map Method: Circling Zeros to get product of sums form
AB 00 01 11 10
1 0 0 1
0 1 0 0
1 1 1 1
1 1 1 1
00
01
11
10 C
CD
A
D
B
F = (B’ + C + D) (A’ + C + D’) (B + C + D’)
F’ = B C’ D’ + A C’ D + B’ C’ D
(F’)’ = (B C’ D’ + A C’ D + B’ C’ D)’
F = (B’ + C + D) (A’ + C + D’) (B + C + D’)
Replace F by F’, 0’s become 1’s and vice versa
![Page 19: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/19.jpg)
19
Don’t Cares
F(A,B,C,D) = m(1,3,5,7,9) + d(6,12,13)
F = w/o don't cares
F = w/ don't cares
Don't Cares can be treated as 1's or 0's if it is advantageous to do soDon't Cares can be treated as 1's or 0's if it is advantageous to do so
AB 00 01 11 10
0 0 X 0
1 1 X 1
1 1 0 0
0 X 0 0
00
01
11
10 C
CD
A
D
B
A'D + B' C' D
C' D + A' D
In Product of Sums form
AB 00 01 11 10
0 0 X 0
1 1 X 1
1 1 0 0
0 X 0 0
00
01
11
10 C
CD
A
D
B
: F = D (A' + C')
Same answer as above, but fewer literals
![Page 20: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/20.jpg)
20
Example: ComparatorDesign Example: Two Bit Comparator
Block Diagramand
Truth Table
A 4-Variable K-mapfor each of the 3output functions
F 1 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1
F 2 0 1 1 1 0 0 1 1 0 0 0 1 0 0 0 0
F 3 0 0 0 0 1 0 0 0 1 1 0 0 1 1 1 0
D 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
C 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1
B 0
1
0
1
A 0
0
1
1
F 1 A B = C D F 2 A B < C D F 3 A B > C D
A B
C D
N 1
N 2
![Page 21: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/21.jpg)
21
Comparator K-Maps
F1 =
F2 =
F3 =
AB 00 01 11 10
1 0 0 0
0 1 0 0
0 0 1 0
0 0 0 1
00
01
11
10 C
CD
A
D
B
K-map for F 1
AB 00 01 11 10
0 0 0 0
1 0 0 0
1 1 0 1
1 1 0 0
00
01
11
10 C
CD
A
D
B
K-map for F 2
AB 00 01 11 10
0 1 1 1
0 0 1 1
0 0 0 0
0 0 1 0
00
01
11
10 C
CD
A
D
B
K-map for F 3
A' B' C' D' + A' B C' D + A B C D + A B' C D'
= (A xnor C) (B xnor D) much simpler, but not in sum of products form1’s on K-map diagonals make XOR or XNOR
A' B' D + B' C D + A' C
B C' D' + A C' + A B D'
![Page 22: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/22.jpg)
22
Example: Two Bit Adder
Block Diagramand
Truth Table
A 4-variable K-mapfor each of the 3output functions
+ N 3
X 0 0 0 0 0 0 0 1 0 0 1 1 0 1 1 1
Y 0 0 1 1 0 1 1 0 1 1 0 0 1 0 0 1
Z 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0
D 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
C 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1
B 0 1 0 1
A 0 0 1 1
A B
C D
N 1
N 2
X Y Z
Cout
![Page 23: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/23.jpg)
23
Adder K-Maps
X = A C + B C D + A B D
Z = B D' + B' D = B xor D
Y = A' B' C + A B' C' + A' B C' D + A' B C D' + A B C' D' + A B C D
= B' (A xor C) + A' B (C xor D) + A B (C xnor D)
= B' (A xor C) + B (A xor C xor D)gate countreduced if
XOR available
1's on diagonal suggest XOR!
AB 00 01 11 10
0 0 0 0
0 0 1 0
0 1 1 1
0 0 1 1
00
01
11
10 C
CD
A
D
B
K-map for X
AB 00 01 11 10
0 0 1 1
0 1 0 1
1 0 1 0
1 1 0 0
00
01
11
10 C
CD
A
D
B
K-map for Y
AB 00 01 11 10
0 1 1 0
1 0 0 1
1 0 0 1
0 1 1 0
00
01
11
10 C
CD
A
D
B
K-map for Z
![Page 24: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/24.jpg)
24
\ D \ A \ C
Y 1
A
C
D
\ B
B
Y 2
Implementations of YTwo alternative
implementations of Ywith and without XOR
Note: XOR typicallyrequires 4 NAND gates
to implement!
X XOR Y
X
Y
![Page 25: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/25.jpg)
26
A 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1
B 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1
C 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1
D 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
W 0 0 0 0 0 0 0 1 1 0 X X X X X X
X 0 0 0 1 1 1 1 0 0 0 X X X X X X
Y 0 1 1 0 0 1 1 0 0 0 X X X X X X
Z 1 0 1 0 1 0 1 0 1 0 X X X X X X
Example: BCD Incrementer
![Page 26: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/26.jpg)
27
Example: BCD Incrementer
W = B C D + A D'
X = B C' + B D' + B' C D
Y = A' C' D + C D'
Z = D'
AB 00 01 11 10
0 0 X 1
0 0 X 0
0 1 X X
0 0 X X
00
01
11
10 C
CD
A
D
B
AB 00 01 11 10
1 1 X 1
0 0 X 0
0 0 X X
1 1 X X
00
01
11
10 C
CD
A
D
B
Z
AB 00 01 11 10
0 0 X 0
1 1 X 0
0 0 X X
1 1 X X
00
01
11
10 C
CD
A
D
B
Y
AB 00 01 11 10
0 1 X 0
0 1 X 0
1 0 X X
0 1 X X
00
01
11
10 C
CD
A
D
B
X W
![Page 27: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/27.jpg)
28
Order Dependency
• Order is important
AB 00 01 11 10
0 0 1 0
1 1 1 0
0 1 1 1
0 1 0 0
00
01
11
10 C
CD
A
D
B
![Page 28: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/28.jpg)
29
Definition of Terms• Implicant:
single element of the ON-set or any group of elements that can be combined together in a K-map (= adjacency plane)
• Prime Implicant (PI) (maximal PI): implicant (a circled set of 1-cells) satisfying the combining
rule, such that if we try to make it larger (covering twice as many cells), it covers one or more 0s.
• Distinguished 1-cell: an input combination that is covered by only one PI.
• Essential Prime Implicant (EPI): a PI that covers one or more distinguished 1-cells.
![Page 29: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/29.jpg)
30
Implicant, PI and EPI6 Prime Implicants:
A' B' D, B C', A C, A' C' D, A B, B' C D
Essential
Minimum cover = First: cover EPIsThen: minimum number of PIs
= B C' + A C + A' B' D
AB 00 01 11 10
0 1 1 0
1 1 1 0
1 0 1 1
0 0 1 1
00
01
11
10 C
CD
A
D
B
![Page 30: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/30.jpg)
31
Implicant, PI and EPI
5 Prime Implicants:
B D, A B C', A C D, A' B C, A' C' D
essential
AB 00 01 11 10
0 0 1 0
1 1 1 0
0 1 1 1
0 1 0 0
00
01
11
10 C
CD
A
D
B
Minimum cover = First: cover EPIsThen: minimum number of PIs
= A B C‘ + A C D + A' B C + A' C' D
![Page 31: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/31.jpg)
32
More Examples
Prime Implicants:
B D, C D, A C, B' C
essential
= BD + AC + B' C
AB 00 01 11 10
0 0 0 0
0 1 1 0
1 1 1 1
1 0 1 1
00
01
11
10 C
CD
A
D
B
![Page 32: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/32.jpg)
33
Primes aroundA B C' D
AB 00 01 11 10
X 1 0 1
0 1 1 1
0 X X 0
0 1 0 1
00
01
11
10 C
CD
A
D
B
Example
Example: f(A,B,C,D) = m(4,5,6,8,9,10,13) + d(0,7,15)
Initial K-map Primes aroundA' B C' D'
AB 00 01 11 10
X 1 0 1
0 1 1 1
0 X X 0
0 1 0 1
00
01
11
10 C
CD
A
D
B
AB 00 01 11 10
X 1 0 1
0 1 1 1
0 X X 0
0 1 0 1
00
01
11
10 C
CD
A
D
B
![Page 33: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/33.jpg)
34
Example: Continued
Primes aroundA B' C' D'
AB 00 01 11 10
X 1 0 1
0 1 1 1
0 X X 0
0 1 0 1
00
01
11
10 C
CD
A
D
B
Essential Primeswith Min Cover
(each element covered once)
AB 00 01 11 10
X 1 0 1
0 1 1 1
0 X X 0
0 1 0 1
00
01
11
10 C
CD
A
D
B
![Page 34: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/34.jpg)
35
5-Variable K-Map
![Page 35: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/35.jpg)
36
5-Variable K-Map
BC DE
BC DE
A =0
A =1
00 01 11 10 00
01
11
10
00 01 11 10 00
01
11
10
0 4 12 8
1 5 13 9
3 7 15 11
2 6 14 10
16 20 28 24
17 21 29 25
19 23 31 27
18 22 30 26
![Page 36: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/36.jpg)
37
5-Variable K-Map
f(A,B,C,D,E) = m(2,5,7,8,10,13,15,17,19,21,23,24,29 31)
1
00
1
10
1
10 BC
DE 00 01 11
00
01
11
10
A=0
BC DE 00 01 11
01
11
10
A=1
1 1
1
1 1
1
1 1
1 1 1
= C E + A B' E + B C' D' E' + A' C' D E'
BC DE 00 01 11 10
00
01
11
10
A=0
BC DE 00 01 11 10
00
01
11
10
A=1
1 1
1
1
1 1
1
1
1 1 1
1 1 1
![Page 37: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/37.jpg)
38
6-Variable K-Map
![Page 38: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/38.jpg)
39
7-Variable K-Map
?
![Page 39: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/39.jpg)
40
8-Variable K-Map
?
![Page 40: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/40.jpg)
41
در جدول کارنوXORترکيب هاي
خانه هاي قطري نشان مي دهند يکي از فرم هايXOR/XNOR است که با دقت بيشتر معلوم مي شود
کدام است.
1
1
0 1
0
1
ba
ab’ + a’b = a XOR b
1
1
0 1
0
1
ba
a’b’ + ab = a XNOR b
![Page 41: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/41.jpg)
42
در جدول کارنوXORترکيب هاي
1 1
1 1
00 01 11 10
0
1
caba’b’c’ + a’bc + abc’ + ab’c= a’(bc)’ + a(bc)= ao(bc)
1 1
1 1
00 01 11 10
0
1
caba’b’c + a’bc’ + abc + ab’c’= a’(bc) + a(bc)’= a(bc)
.
![Page 42: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/42.jpg)
43
در جدول کارنوXORترکيب هاي
1
1
00 01 11 10
0
1
caba’(b’c’ + bc)= a’(bc)
a’.(boc) با بررسي بيشتر داخل :o.معلوم مي شود
1
1
00 01 11 10
0
1
cabb(aoc)b(a’c’ + …)= b (aoc).
![Page 43: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/43.jpg)
44
در جدول کارنوXORترکيب هاي ab
00 01 11 10
1 1
1 1
00
01
11
10 c
cd
a
d
b
c’(aobod)
ab00 01 11 10
1
1
00
01
11
10 c
cd
a
d
b
bd(aoc)
![Page 44: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/44.jpg)
45
در جدول کارنوXORترکيب هاي
1 1
1 1
00 01 11 10
0
1
cab
a’c’ + ac
1 1
1 1
00 01 11 10
0
1
cabac’+a’c
![Page 45: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/45.jpg)
46
در جدول کارنوXORترکيب هاي
1 1
1 1
00 01 11 10
0
1
cab
bc’ + b’c=(bc)
1 1
1 1
00 01 11 10
0
1
cabb’c’ + bc
![Page 46: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/46.jpg)
47
در جدول کارنوXORترکيب هاي
قوت روش:• به خصوص وقتيdon’t care.داريم
![Page 47: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/47.jpg)
48
Implementing by Nands only
• Nand: Universal gate can replace gates by equivalent
Nand circuit. Large circuit (many gates)
But
![Page 48: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/48.jpg)
49
New Symbols for AND/OR
• DeMorgan’s Law: (a + b)’ = a’ b’ (a b)’ = a’ + b’ a + b = (a’ b’)’ (a b) = (a’ + b’)’
= =
==
![Page 49: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/49.jpg)
50
New Symbols for NOT
(a . a)’ = a’
A AAA_
A A
(a + a)’ = a’
![Page 50: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/50.jpg)
51
NAND-Only Implementation Find Sum-of-Product form.
Inventers can be added
Equivalent NAND-only
![Page 51: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/51.jpg)
52
Another Example
![Page 52: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/52.jpg)
53
NOR-Only Implementation Find Product-of-Sums form.
Inverters can be added
Equivalent NOR-only
![Page 53: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/53.jpg)
54
NAND-Only Implementation
• NAND-only: Another method:
Group 0s in K-Map Find F’ in SOP form Add an inverter at the end.
![Page 54: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/54.jpg)
55
NAND-Only Implementation• Multi-Level Circuits
Convert AND/OR gates to proper NAND gatesAND AND-NOT symbolOR NOT-OR symbol
Bubbles must cancel each other;
otherwise, insert a NAND inverter.
Take care of appropriate input literals.
![Page 55: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/55.jpg)
56
NAND-Only Implementation
• Example:
![Page 56: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/56.jpg)
57
NAND-Only Implementation
• Another Example:
![Page 57: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/57.jpg)
58
NAND-Only Implementation• Be careful about branches:
Gates with multi-fanouts
A
B C
D
F X
(a)
A
B C
D’
F X’
(b) (c)
A
B C
D’
F X’
X
![Page 58: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/58.jpg)
59
NOR-Only Implementation
• NOR-Only: Use “Duality” for the last several
slides.
![Page 59: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/59.jpg)
60
Analysis of NAND Circuits The functionality of a NAND-only circuit is
not clear. Must be converted to AND-OR circuit.
![Page 60: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/60.jpg)
61
Analysis of NAND Circuits
• Example
![Page 61: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/61.jpg)
62
Analysis of NAND/NOR Circuits
![Page 62: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/62.jpg)
63
Analysis of NAND/NOR Circuits
![Page 63: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/63.jpg)
Variable-Entered Maps
![Page 64: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/64.jpg)
65
Variable-Entered Maps
Using a 3-variable K-Map for a 4-variable function
)(),,,( '''''' CABcaredontABCDDBCABCACBADCBAF
Extract some variables out of the function:
)5(.73.21),,,( mcaredontDmmDmmDCBAF
![Page 65: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/65.jpg)
66
Variable-Entered Maps
• Example:
To enter the variables in the K-map:
terms)caret don'(
),,,,,( 1511975320
mmFmEmEmmmmFEDCBAG
![Page 66: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/66.jpg)
67
Variable-Entered Maps
..... 22110 SPSPSF
Pi’s are map-entered variables
S0 : minimum sum obtained by P1=P2=…=0
S1 : minimum sum obtained by P1=1, Pj=0 (j=/ 1) and replacing
all ‘1’’s on the map with ‘don’t cares (X)’
S2 : minimum sum obtained by P2=1, Pj=0 (j=/ 2) and replacing
all ‘1’’s on the map with ‘don’t cares (X)’
Ss:….
Can consider F as:
To group map entries:
![Page 67: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/67.jpg)
68
Variable-Entered Maps
A 6-variable function
)13101 : termscaret don'(
),,,,,( 1511975320
mmm
mmFmEmEmmmmFEDCBAG
• Example:
)()'(''),,,,,( ADFDAEACDBAFEDCBAG
![Page 68: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/68.jpg)
69
Variable-Entered MapsBoth C and C’ in the map-entered variables:
F = A' B C' + A B’ C + A B C' + A B C
= A' B (C') + A B’ (C) + A B (1)
A 0 0 0 0 1 1 1 1
B 0 0 1 1 0 0 1 1
C 0 1 0 1 0 1 0 1
F 0 0 1 0 0 1 1 1
A 0 0 1 1
B 0 1 0 1
F 0 C’ C 1
0
C’
C
1
C
C’ 1
0 1
0
1
BA
![Page 69: بهينه سازي با نقشة کارنو](https://reader035.vdocument.in/reader035/viewer/2022062723/56813d12550346895da6d15b/html5/thumbnails/69.jpg)
70
Variable-Entered Maps
F = A' B (C') + A B’ (C) + A B
C
C’ 1
0 1
0
1
BA
1 1
0 1
0
1
BA
C = 0
1
X
0 1
0
1
BA
C = 1
C
C’ 1
0 1
0
1
BA
F = AC + BC’