Announcements Project components starting to arrive No assignment due this week – assignment 7 will be posted on Thursday. Final exam date. Let’s leave.

Slides:



Advertisements
Similar presentations
Digital Circuits.
Advertisements

ECE 238L Computer Logic Design Spring 2010
Boolean Algebra and Reduction Techniques
Lecture 20, Slide 1EECS40, Fall 2004Prof. White Lecture #20 ANNOUNCEMENT Midterm 2 Thursday Nov. 18, 12:40 – 2:00 pm A-L initials in F295 Haas Business.
Week 11b, Slide 1EECS42, Fall 2005Prof. White Week 11b OUTLINE – Synthesis of logic circuits – Minimization of logic circuits Reading: Hambley Ch. 7 through.
How to build a digital gate. CMOS NAND Gate Several realization of NOT 1. This is how a NOT operation is often represented schematically. 2. Sometimes.
Lecture 14 Today we will Learn how to implement mathematical logical functions using logic gate circuitry, using Sum-of-products formulation NAND-NAND.
Give qualifications of instructors: DAP
4/11/03 Minute Paper How does MS window work? Like how do we have the screen on the computer. Is it just a bunch of Binary #’s representing colors? When.

EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
بهينه سازي با نقشة کارنو Karnaugh Map. 2  Method of graphically representing the truth table that helps visualize adjacencies 2-variable K-map 3-variable.
Unit 8 Combinational Circuit Design and Simulation Using Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science.
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
Boolean Algebra and Logic Simplification
Logic Function Optimization. Combinational Logic Circuit Regular SOP and POS designs Do not care expressions Digital logic circuit applications Karnaugh.
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
1 Simplification of Boolean Functions:  An implementation of a Boolean Function requires the use of logic gates.  A smaller number of gates, with each.
 Seattle Pacific University EE Logic System DesignSOP-POS-1 The Connection: Truth Tables to Functions abcF abcF
Department of Computer Engineering
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. K-Map (1)  Karnaugh Mapping is used to minimize the number of logic gates that are required in a digital circuit.
9/15/09 - L7 Two Level Circuit Optimization Copyright Joanne DeGroat, ECE, OSU1 Two Level Circuit Optimiztion An easier way to generate a minimal.
1 Digital Logic Design Week 5 Simplifying logic expressions.
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
Optimization Algorithm
Digital Electronics Lecture 6 Combinational Logic Circuit Design.
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.
Minimisation ENEL111. Minimisation Last Lecture  Sum of products  Boolean algebra This Lecture  Karnaugh maps  Some more examples of algebra and truth.
XOR Operator A short digression… … to introduce another Boolean operation: exclusive- OR (XOR) ABA + B XOR.
Digital Logic Design Week 4 Boolean algebra. Laws and rules De Morgan’s theorem Analysis of logic circuits Standard forms Project 1 preparation.
Lecture 11 Combinational Design Procedure
Boolean Algebra and Reduction Techniques
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
Conversion from one number base to another Binary arithmetic Equation simplification DeMorgan’s Laws Conversion to/from SOP/POS Reading equations from.
Karnaugh Maps (K maps). What are Karnaugh 1 maps?  Karnaugh maps provide an alternative way of simplifying logic circuits.  Instead of using Boolean.
Announcements Assignment 6 due tomorrow No Assignment 7 yet.
Designing Combinational Logic Circuits
DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor
Karnaugh Maps (K-Maps)
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
THE K-MAP.
 Seattle Pacific University EE Logic System DesignKMaps-1 Two-Level Simplification All Boolean expressions can be represented in two- level forms.
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2003 Topic 4: Cost of Logic Circuits and Karnaugh Maps José Nelson Amaral.
1 3- De-Morgan’s Theorems 1.The complement of a product of variables is equal to the sum of the complements of the variables. 2. The complement of a sum.
Karnaugh Maps (K maps).
Introduction to Digital Electronics Lecture 5: Function Minimisation.
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
1 CS 352 Introduction to Logic Design Lecture 4 Ahmed Ezzat Multi-level Gate Circuits and Combinational Circuit Design Ch-7 + Ch-8.
ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.
K-maps and Decoders Prof. Sin-Min Lee Department of Computer Science.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC:K-Map. K-Map (1)  Karnaugh Map provides a systematic method for simplifying Boolean expressions and may produce.
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
Reading: Hambley Chapters
CSE 140 : Components and Design Techniques for Digital Systems
Digital Logic and Design
Karnaugh Maps (K-Maps)
BASIC & COMBINATIONAL LOGIC CIRCUIT
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
Optimization Algorithm
Reading: Hambley Ch. 7 through 7.5
ECB2212-Digital Electronics K-Map
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Karnaugh Maps (K maps).
Analysis of Logic Circuits Example 1
Laws & Rules of Boolean Algebra
Computer Architecture
Reading: Hambley Ch. 7 through 7.5
Presentation transcript:

Announcements Project components starting to arrive No assignment due this week – assignment 7 will be posted on Thursday. Final exam date. Let’s leave it where it is (Dec 13 th ). Project reports due to me by , Sunday Dec 11 th. Individual reports. NO EXTENSIONS

Lecture 17 Overview Karnaugh map examples Applications of Combinational logic

Karnaugh Maps: Example 2: ABCDO Draw the table

Karnaugh Maps: Example 2: ABCDO AB CD Draw the table

Karnaugh Maps: Example 2: ABCDO AB CD Draw the table Find any isolated cells - 1's with no neighbours

Karnaugh Maps: Example 2: ABCDO AB CD Draw the table Find any isolated cells Find any 2-cell subcubes which are not adjacent to other 2-cell subcubes. Remember wrapping AB CD

Karnaugh Maps: Example 2: ABCDO AB CD Draw the table Find any isolated cells Find 2-cell subcubes. Find 4-cell subcubes which are not adjacent to other four cell subcubes Find 8-cell subcubes etc etc. Minimal expression is formed by the smallest number of maximal subcubes

Karnaugh Maps: Example 2: ABCDO AB CD A'·B'·D'

Karnaugh Maps: Example 2: ABCDO B'·C' AB CD

Karnaugh Maps: Example 2: ABCDO C'·D AB CD

Karnaugh Maps: Example 2: ABCDO A·D AB CD

Karnaugh Maps: Example 2: ABCDO So sum-of products realization is: O=A'·B'·D'+B'·C'+C'·D+AD Requires 9 gates AB CD

Karnaugh Maps: Example 2: ABCDO So sum-of products realization is: O=A'·B'·D'+B'·C'+C'·D+AD Requires 9 gates A'·B'·D' B'·C' C'·D AD

Karnaugh Maps: Your turn ABCDO

ABCDO AB CD Solve the Karnaugh map and draw the circuit

Karnaugh Maps: Fill the map ABCDO AB CD

Karnaugh Maps: Find the subcubes ABCDO AB CD

Karnaugh Maps: Evaluate ABCDO AB CD A' B'C' sum of products realization is A'+B'C'

Karnaugh Maps: Evaluate ABCDO sum of products realization is A'+B'C'

Karnaugh Maps: Setting up the Maps DeMorgan's Theorem shows that any logic function can be implemented by using just OR and NOT gates, or by just AND and NOT gates A consequence of this is that any logical expression can be reduced to either a "Sum-of-Products" form or a "Product-of-Sums" form

Karnaugh Maps: Boxing zeros for sum of products So far, we have been "boxing the ones" for a sum-of-products It is also possible to realize a sum-of-products by "boxing the zeros" Truth table Karnaugh Map A'·B' A·C So, realization is O=(A'·B'+A·C)' (all inverted as we've boxed zeros) Can convert to a product-of-sums with DeMorgan's Theorem: (A'·B'+A·C)' =(A'·B')'·(A·C)'= (A+B)·(A·C)'=(A+B)·(A'+C')

Karnaugh Maps: Boxing zeros for product of sums Knowing this, we can get the same product of sums more directly Truth table Karnaugh Map A+B A'+C' So, realization is O=(A+B)·(A'+C') We have to NOT the inputs, then:

Karnaugh Maps So O=(A+B)·(A'+C') This requires 5 gates: Note: this realization, part sum of products, part product of sums: O=(A+B)·(A·C)' only requires 3 gates:

Sum of Products (X·Y+W·Z)Product of sums (X+Y)·(W+Z) Box 1'sBox 0's AND operation among inputs which are not changing OR operation among NOTted inputs which are not changing OR operation between boxes AND operation between boxes Result must be NOTted for final answer Choose whether to box 1's or 0's by looking at the map - if you have more 0's, boxing 0's will lead to greater simplification

Another Karnough Example: 7 segment displays Truth Table Karnaugh Map for "a" "x" represents a "don't care" condition - the value can be either 0 or 1 Control segments with 4 binary inputs Need a logic circuit for each segment

Box the ones for sum-of-products This subcube: B This subcube: A'·C' This subcube: D This subcube: A·C

Realization (sum-of-products) is B+D+ A·C+ A'·C'

Karnaugh Maps More generally, Karnaugh maps can be used to simplify any logic function (doesn’t have to be electronics!)

Final comment on Karnaugh Maps AB CD