Lecture 3
-
Upload
ifeoma-waters -
Category
Documents
-
view
15 -
download
0
description
Transcript of Lecture 3
![Page 1: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/1.jpg)
Lecture 3
Karnaugh MapChapter 2
Jack Ou, Ph.D.
![Page 2: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/2.jpg)
Home Alarm Logic
![Page 3: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/3.jpg)
Home Alarm Truth Table
![Page 4: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/4.jpg)
Sum of Products Equation
Parts• 12 inverters • 3 2-input AND gates for each 4-input AND gate. Therefore, 24 2-input AND gates. • 7 2-input OR gates.
![Page 5: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/5.jpg)
NAND Based Logic Gates
![Page 6: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/6.jpg)
Delay Calculations
Parts• 12 inverters (1 TTL delay)• 3 2-input AND gates for each 4-input AND gate. Therefore, 24 2-input AND gates.
• Each AND gate: 2 TTL delay• For each 4-input ANDN gate: 4 TTL delay
• 7 2-input OR gates. • 2 TTL delay for each OR gate• 7 2-input OR gates (6 TTL delay)
• Total delay: 6 TTL delay+4 TTL delay+1 TTL delay=11 TTL delay
![Page 7: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/7.jpg)
Simplification Technique #1: Ordered the Truth Table using Gray Code
Discontinuity disappears!
![Page 8: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/8.jpg)
Use Don’t Cares to Simplify the Truth Table
![Page 9: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/9.jpg)
Simplified SoP
Parts:• Inverters: 4 inverters (1 TTL delay)• 4 3-input AND gates
• Each 3-input AND gate requires 2 2-input AND gate: • 2 x4=8 2-input AND gate (4 TTL delay)
• 3 2-input OR gate (4 TTL delay)• Maximum 9 TTL delay (4+4+1)
![Page 10: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/10.jpg)
Move Don’t Care Bits Closer Together
Parts:• 1 inverter (1 delay)• 2 AND gates (2 delays)• 1 OR gate (2 delay)• 5 delay
![Page 11: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/11.jpg)
Steps for Creating a Karnaugh Map
• Create an Equivalent Karnaugh Map• Each circle must be around a power of two
number of bits• It is not a problem if circles overlap
![Page 12: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/12.jpg)
Equivalent Karnaugh Map
![Page 13: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/13.jpg)
Example 1
![Page 14: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/14.jpg)
Example 2
![Page 15: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/15.jpg)
Example 3
![Page 16: Lecture 3](https://reader035.fdocuments.us/reader035/viewer/2022072014/56812e03550346895d936728/html5/thumbnails/16.jpg)
Home Alarm Example