{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture05

# Lecture05 - ENGRD 2300 Introduction to Digital Logic Design...

This preview shows pages 1–6. Sign up to view the full content.

ENGRD 2300 Introduction to Digital Logic Design Fall 2009 Combinational Logic: Component Minimization (Karnaugh Maps) Lecture 5: 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Announcements Review Ch 1, Ch 3.1-3.3, Ch 4.1-4.3 Lab 2 prelab due Fri, Sept 11 at 1:25pm Be sure to include your truth tables and sum-of- products expressions in your readme.txt or readme.pdf! HW 1 due Wed, Sept 16 at 1:25pm Lab 3 will be posted soon! Prelab will be due Fri, Sept 18 at 1:25pm Prelim 2 Makeup If you have a conflict and did not get email from me, let me know ASAP If you have a conflict on either of the alternative Lecture 5: 2 If you have a conflict on either of the alternative dates, answer the appropriate email ASAP
3-Variable Karnaugh Map X Columns where X = 1 00 01 11 10 XY Z Rows where Z = 1 0 0 2 6 4 1 Z 1 3 7 5 Y Columns where Y = 1 Lecture 5: 3

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
3-Variable Karnaugh Map Example X=1 F= Σ X,Y,Z (4,5,6,7) 00 01 11 10 XY Z 0 0 1 1 0 0 0 1 1 1 Z=1 F = X Y 1 Lecture 5: 4 Y=1
Karnaugh Map Usage Plot 1’s corresponding to minterms of function Circle largest possible rectangular sets of 1s # of 1s in set must be power of 2 OK to cross edges (and wrap around)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}