CENG 241 Digital Design 1 Lecture 4
description
Transcript of CENG 241 Digital Design 1 Lecture 4
![Page 2: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/2.jpg)
2
This Lecture
Review of last lecture: Gate-Level Minimization Continue Chapter 3:Don’t-Care Conditions,
Implementation
![Page 3: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/3.jpg)
3
Gate-Level Minimization
The Map Method: A simple method for minimizing Boolean functions
Map: diagram made up of squares Each square represents a minterm
![Page 4: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/4.jpg)
4
Three-Variable Map
Each variable is 1 in 4 squares, 0 in 4 squares
Variable appears unprimed in squares equal to 1 Variable appears primed in squares equal to 0
Each variable is 1 in 4 squares, 0 in 4 squares
![Page 5: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/5.jpg)
5
Four-Variable Map
![Page 6: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/6.jpg)
6
Five-Variable Map
Maps for more than four variables are not easy to use.
Five-variable maps require 32 squares.
Alternative: Use two four-variable maps to make a five-variable one
Minterms 0 to 15 in one map. 16 to 31 in the other one.
![Page 7: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/7.jpg)
7
Five-Variable Map
Each square in the A=0 map is adjacent to the corresponding one in the A=1 map.
![Page 8: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/8.jpg)
8
0’s in the map
For a function F, combining the 0 squares gives us F’.
By using F’ and the DeMorgan’s law, we can simplify the function to product of sums.
F’=AB+CD+BD’
TYPO
![Page 9: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/9.jpg)
9
Gate implementation-example 4
SUM of Products Products of Sums
![Page 10: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/10.jpg)
10
Don’t-Care Conditions
There are applications that the function is not specified for certain combinations and variables.
Mark don’t-cares with X, assume either 1 or 0 to simplify the function.
![Page 11: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/11.jpg)
11
Don’t-Care Conditions
Simplify the Boolean function F(w,x,y,z)=Σ(1,3,7,11,15) which has the don’t-care conditionsd(w,x,y,z)= Σ(0,2,5)
![Page 12: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/12.jpg)
12
NAND and NOR implementations
Ease of fabrication:
Digital circuits are made of NAND or NOR, rather than AND and OR gates.
We need rules to convert from AND/OR/NOT to NAND/NOR circuits.
NAND gate is a universal gate because any digital circuit can be implemented using it.
![Page 13: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/13.jpg)
13
Graphic symbols for NAND gates
![Page 14: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/14.jpg)
14
Two-Level Implementation
Three implementations for A.B+C.D
![Page 15: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/15.jpg)
15
Implement the following function with NAND gates: F(x,y,z)=(1,2,3,4,5,7)
Example 3-10
![Page 16: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/16.jpg)
16
Sum of Products and Product of Sums result in two level designs
Not all designs are two-level e.g., F=A.(C.D+B)+B.C’
How do we convert multilevel circuits to NAND circuits?
Rules 1-Convert all ANDs to NAND gates with AND-invert
symbol 2-Convert all Ors to NAND gates with invert-OR symbols 3-Check the bubbles, insert bubble if not compensated
Multilevel NAND circuits
![Page 17: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/17.jpg)
17
Multilevel NAND circuits
BC’
B’
![Page 18: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/18.jpg)
18
Multilevel NAND circuits
![Page 19: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/19.jpg)
19
NOR implementation
NOR is NAND dual so all NOR rules are dual of NAND rules.
All designs can be made by NORs
![Page 20: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/20.jpg)
20
NOR symbols
NOR implementation requires the function expressed in product of sums
NOR implementation Rules 1-Convert all ORs to NOR gates with OR-invert symbol 2-Convert all ANDs to NOR gates with invert-AND symbols 3-Check the bubbles, insert bubble if not compensated
![Page 21: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/21.jpg)
21
NOR circuits
![Page 22: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/22.jpg)
22
NOR circuits
Figure 3-23(a) converted to NOR implementation:
![Page 23: CENG 241 Digital Design 1 Lecture 4](https://reader035.fdocuments.us/reader035/viewer/2022062309/56814953550346895db6a27b/html5/thumbnails/23.jpg)
23
Summary
Reading: up to end of NAND and NOR implementations
Gate-level Minimization, Implementation