Page 1 1 Lecture 30, Slide 1 EECS40, Fall 2003 Prof. King Lecture #30 ANNOUNCEMENTS • Lab project: – No lab sections will be held next Tuesday (Veterans Day). A special section will be held next Monday at 6 PM for the Tuesday-section students to pick up their Tutebot kits. – For extra credit (full points on HW portion of course grade): • Each team of 2 must demo. 1 additional behavior • Each team of 3 must demo. 2 additional behaviors • Extra credit for top Tutebot in class: 5 pts on course grade OUTLINE » Sequential logic circuits Reading: Schwarz & Oldham pp. 411-420 Lecture 30, Slide 2 EECS40, Fall 2003 Prof. King Further Comments on Karnaugh Maps • The algebraic manipulations needed to simplify a given expression are not always obvious. Karnaugh maps make it easier to minimize the number of terms in a logic expression. • Terminology: – “2-cube: 2 squares that have a common edge (-> product of 3 variables) – “4-cube: 4 squares with common edges (-> product of 2 variables) • In locating cubes on a Karnaugh map, the map should be considered to fold around from top to bottom, and from left to right. – Squares on the right-hand side are considered to be adjacent to those on the left-hand side. – Squares on the top of the map are considered to be adjacent to those on the bottom. –Example: The four squares in the map corners form a 4-cube CD 00 01 11 10 AB 00 01 11 10Read More

Offer running on EduRev: __Apply code STAYHOME200__ to get INR 200 off on our premium plan EduRev Infinity!