enee244-02xx digital logic design lecture 5. announcements homework 1 solutions are on canvas...
TRANSCRIPT
![Page 1: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/1.jpg)
ENEE244-02xxDigital Logic Design
Lecture 5
![Page 2: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/2.jpg)
Announcements
• Homework 1 solutions are on Canvas• Homework 2 due on Thursday• Coming up: First midterm on Sept. 30
![Page 3: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/3.jpg)
Agenda
• Last time:– Boolean Algebra axioms and theorems (3.1,3.2)– Canonical Forms (3.5)
• This time:– Finish up Canonical Forms (3.5)– Manipulations of Boolean Formulas (3.6)– Gates and Combinational Networks (3.7)– Incomplete Boolean Functions and Don’t Care
Conditions (3.8 )
![Page 4: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/4.jpg)
Canonical Forms (Review)
•
X Y Z f
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 0
![Page 5: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/5.jpg)
Canonical Forms Conversion
• Minterm to Maxterm:
• Maxterm to Minterm:
![Page 6: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/6.jpg)
Manipulations of Boolean Formulas
![Page 7: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/7.jpg)
Equation Complementation
• For every Boolean function there is an associated complementary function in which iff
• Example:
![Page 8: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/8.jpg)
Equation Complementation
• Use DeMorgan’s Law to simplify:
![Page 9: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/9.jpg)
Expansion about a Variable
• Rewrite a Boolean formula so that it has the structure:
OR
![Page 10: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/10.jpg)
Expansion about a Variable
Theorem 3.11
(b)
![Page 11: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/11.jpg)
Expansion about a Variable
• Examples:
Expansion about
![Page 12: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/12.jpg)
Shannon’s Reduction Theorems
• Used for obtaining simplified Boolean formula.Theorem 3.12(a) (b) Theorem 3.13(a)(b)
![Page 13: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/13.jpg)
Example of Equation Simplification
![Page 14: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/14.jpg)
Gates and Combinational Networks
![Page 15: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/15.jpg)
Digital Logic Gates
• AND • OR • NOT (Inverter) • Buffer (Transfer) • NAND • NOR • XOR • X-NOR (Equivalence)
![Page 16: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/16.jpg)
![Page 17: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/17.jpg)
Gates and Combinational Networks• Synthesis Procedure• Example: Truth table for parity function on
three variablesX Y Z f
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1
![Page 18: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/18.jpg)
Synthesis ProcedureX Y Z f
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1
Minterm Canonical Form:xyz
![Page 19: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/19.jpg)
Two-level Gate NetworkMinterm Canonical Form:
𝑥𝑦𝑧𝑥𝑦𝑧𝑥𝑦𝑧𝑥𝑦𝑧
![Page 20: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/20.jpg)
Incomplete Boolean Functions and Don’t Care Conditions
![Page 21: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/21.jpg)
Incomplete Boolean Functions and Don’t Care Conditions
• n-variable incomplete Boolean function is represented by a truth table with n+1 columns and rows.
• For those combinations of values in which a functional value is not to be specified, a symbol, --, is entered.
• The complement of an incomplete Boolean function is also an incomplete Boolean function having the same unspecified rows of the truth table.
![Page 22: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/22.jpg)
Describing Incomplete Boolean Functions
X Y Z F
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 --
1 0 0 0
1 0 1 --
1 1 0 0
1 1 1 1
Minterm canonical formula:
![Page 23: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/23.jpg)
Describing Incomplete Boolean Functions
X Y Z F
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 --
1 0 0 0
1 0 1 --
1 1 0 0
1 1 1 1
Maxterm canonical formula:
![Page 24: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/24.jpg)
Describing Incomplete Boolean Functions
• Manipulating Boolean equations derived from incomplete Boolean functions is a very difficult task.
• In the next chapter, there are procedures for obtaining minimal expressions that can handle the don’t care conditions.
• Can leverage don’t care conditions to get simplified expressions for functions (smaller gate networks).
![Page 25: ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept](https://reader035.vdocuments.us/reader035/viewer/2022062222/5697c0301a28abf838cdaac1/html5/thumbnails/25.jpg)
{𝑥𝑦 , 𝑥 𝑦 }{𝑥 𝑦 , 𝑥 𝑦 }