ENEE244-02xx Digital Logic Design Lecture 12. Announcements HW4 due today HW5 is up on course webpage. Due on 10/16. Recitation quiz on Monday, 10/13.

Slides:



Advertisements
Similar presentations
Techniques for Combinational Logic Optimization
Advertisements

ENEE244-02xx Digital Logic Design Lecture 10. Announcements HW4 due 10/9 – Please omit last problem 4.6(a),(c) Quiz during recitation on Monday (10/13)
Figure 4.1. The function f (x1, x2, x3) =  m(0, 2, 4, 5, 6).
ECE 3110: Introduction to Digital Systems
Gate-Level Minimization
ECE 3110: Introduction to Digital Systems Simplifying Sum of Products using Karnaugh Maps.
ITEC 352 Lecture 4 Boolean logic / Karnaugh Maps.
KARNAUGH MAP Introduction Strategy for Minimization Minimization of Product-of-Sums Forms Minimization of More Complex Expressions Don't care Terms 1.
Digital Electronics Course Introduction, Number Systems, Conversion between Bases, and Basic Binary Arithmetic (Lecture #1)
Lecture 4 More Examples of Karnaugh Map. Logic Reduction Using Karnaugh Map Create an Equivalent Karnaugh Map Each circle must be around a power of two.
CS 140 Lecture 5 Professor CK Cheng 10/10/02. Part I. Combinational Logic 1.Spec 2.Implementation K-map: Sum of products Product of sums.
CS 140 Lecture 3 Professor CK Cheng Tuesday 4/09/02.
CSE-221 Digital Logic Design (DLD)
CS 140 Lecture 4 Professor CK Cheng Tuesday 5/08/02.
CS 140 Lecture 4 Professor CK Cheng 4/11/02. Part I. Combinational Logic Implementation K-Map Given F R D Obj: Minimize sum of products Proc: Draw K-Map.
Gate-Level Minimization1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
ENEE244-02xx Digital Logic Design Lecture 7. Announcements Homework 3 due on Thursday. Review session will be held by Shang during class on Thursday.
ENEE244-02xx Digital Logic Design Lecture 10. Announcements HW4 assigned, due 10/9.
ECE 331 – Digital System Design Karnaugh Maps and Determining a Minimal Cover (Lecture #7) The slides included herein were taken from the materials accompanying.
ENEE x Digital Logic Design Lecture 20. Announcements Homework 6 due today. Homework 7 up on course webpage, due on 11/13. Recitation quiz on Monday,
ECE 301 – Digital Electronics Karnaugh Maps and Determining a Minimal Cover (Lecture #8) The slides included herein were taken from the materials accompanying.
Digital Logic Design Lecture 28. Announcements Homework 9 due on Thursday 12/11 Please fill out Course Evaluations online. Final exam will be on Thursday,
CS 140 Lecture 5 Professor CK Cheng CSE Dept. UC San Diego 1.
ENEE244-02xx Digital Logic Design Lecture 4. Announcements HW 1 due today. HW 2 up on course webpage, due on Thursday, Sept. 18. “Small quiz” in recitation.
Lecture 6 Karnaugh Map. Logic Reduction Using Karnaugh Map Create a Karnaugh Map Circle (2, 4, 8..) 1’s. OR the minterm generated by each loop.
Digital Logic & Design Vishal Jethava Lecture 12 svbitec.wordpress.com.
1 Chapter 5 Karnaugh Maps Mei Yang ECG Logic Design 1.
9/15/09 - L27 CountersCopyright Joanne DeGroat, ECE, OSU1 Final Exam Review Exam Time: MONDAY o dark 30 7:30AM this room.
ENEE244-02xx Digital Logic Design Lecture 3. Announcements Homework 1 due next class (Thursday, September 11) First recitation quiz will be next Monday,
ENEE244-02xx Digital Logic Design Lecture 6. Announcements Homework 2 due today Homework 3 up on webpage Coming up: First midterm on Sept. 30 – Will cover.
Karnaugh map minimization Basic Terms (1) minterm maxterm - a single 1 - a single 0 1. implicant
Karnaugh Maps ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 3.
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
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.
September 8, 2014 What are we doing today? Correct – Solving Equations by Adding or Subtracting - HW – Pg #1-12 all, evens Due: 1.2.
Lecture # 5 University of Tehran
CEC 220 Digital Circuit Design More Karnaugh Maps Monday, February 02 CEC 220 Digital Circuit Design Slide 1 of 11.
Lecture 4: Four Input K-Maps CSE 140: Components and Design Techniques for Digital Systems CK Cheng Dept. of Computer Science and Engineering University.
CEC 220 Digital Circuit Design Implicants Wed, Sept. 23 CEC 220 Digital Circuit Design Slide 1 of 10.
ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)
Digital Logic & Design Dr. Waseem Ikram Lecture 09.
NAND as a complete system and Karnaugh Maps
Minimization of Circuits
ECE 2110: Introduction to Digital Systems
Lecture #6 EGR 277 – Digital Logic
CSE 140: Components and Design Techniques for Digital Systems
Plotting functions not in canonical form
ECE 2110: Introduction to Digital Systems
EEL 3705 / 3705L Digital Logic Design
ECE 331 – Digital System Design
Karnaugh Maps (K-Maps)
Instructor: Alexander Stoytchev
CSE140 HW2 Preparation Xinyuan Wang 04/20/2018.
Instructor: Alexander Stoytchev
ECE 331 – Digital System Design
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
CSE 140: Components and Design Techniques for Digital Systems
ECE 331 – Digital System Design
ECE 331 – Digital System Design
Introduction to Digital Systems
Quine-McClusky Minimization Method
Chapter 10.3 and 10.4: Combinatorial Circuits
Instructor: Alexander Stoytchev
Professor CK Cheng CSE Dept. UC San Diego
Instructor: Alexander Stoytchev
CSE 140 Lecture 4 Combinational Logic: K-Map
Simplification of Boolean Functions using K-Maps
ECE 331 – Digital System Design
Reading: Hambley Ch. 7 through 7.5
Presentation transcript:

ENEE244-02xx Digital Logic Design Lecture 12

Announcements HW4 due today HW5 is up on course webpage. Due on 10/16. Recitation quiz on Monday, 10/13 – Will cover the material from lectures 10,11,12.

Agenda Examples of finding minimal sums for 3- variable and 4-variable Boolean functions.

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums Step 1: Find all prime implicants Verify these are the only prime implicants

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums Step 1: Find all prime implicants Verify these are the only prime implicants

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums Step 1: Find all prime implicants Verify these are the only prime implicants

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums Step 1: Find all prime implicants Verify these are the only prime implicants

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums Step 1: Find all prime implicants Verify these are the only prime implicants

Using Karnaugh Maps to Find Minimal Sums

Using Karnaugh Maps to Find Minimal Sums