QUIZ: Perform the minimization using K-maps Ladder logic” analysis The minimization in (c) ......
Transcript of QUIZ: Perform the minimization using K-maps Ladder logic” analysis The minimization in (c) ......
Chapter 3
Analysis and Design
of Logic Circuits
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Types of IC packages
PGA (Pin Grid Array) PLCC (Plastic Leaded Chip Carrier)
Flat Package SO (Small Outline) Package
DIP
“Ladder logic” analysis
The minimization in (c) can be done w/any of the methods covered
(Boolean algebra, Venn diagrams, K-maps)
“Ladder logic” design
AND = series, OR = parallel
QUIZ: Design the ladder logic circuit that implements
3.3.2 Analyzing circuits made out of gates
Practice converting between SOP and POS forms using DeMorgan!
To do for next time
• Read entire Sections 3.2, 3.3
• Read Section 3.4 (Generating …)
• Solve in notebook end-of-chapter 1-7 and 17.
QUIZ
In the first problem of Lab 3, we obtained this Boolean function: (A+B)∙(B+C)
Find it’s minimized S.O.P. form using:
• Truth table and K-map
• Boolean algebra manipulations
• Venn diagrams
3.6 Propagation delay
For a wire, it depends on 3 factors:
• Length
• Diameter
• Material:
• Au fastest, Ag next … but they’re both expensive
• Cu is next, but plentiful and easy to manufacture
• Al is slowest (poorest electrical conductivity), but 3
times lighter than Cu! So why not transition to Al
wiring?
http://www.picwire.com/technical/paper3.html
QUIZ
Find the (worst-case)
propagation delay
through this circuit in
two ways:
• Largest # of gates in
path
• Propagation delay for
a gate is 1ns∙fan-in
To do for next time
• Read entire Sections 3.5, 3.6, 3.7
• Solve in notebook end-of-chapter 39, 47-50, 54.
Monday lecture: review for midterm
Next week lab: midterm
QUIZ
Find the (worst-case)
propagation delay
through this circuit in
two ways:
• Largest # of gates in
path
• Propagation delay for
a gate is 1ns∙fan-in