Lecture 5 Dr. Nermin Hamza.

Slides:



Advertisements
Similar presentations
BOOLEAN ALGEBRA. A Mathematical notation used to represent the function of the Digital circuit. A notation that allows variables & constants to have only.
Advertisements

Prof. Sin-Min Lee Department of Computer Science
Based on slides by: Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 8 – Systematic Simplification.
1 Optimizations and Tradeoffs We now know how to build digital circuits –How can we build better circuits? Let’s consider two important design criteria.
Karnaugh Maps for Simplification
EECC341 - Shaaban #1 Lec # 7 Winter Combinational Circuit Minimization Canonical sum and product logic expressions do not provide a circuit.
Simplifying Boolean Expressions Using K-Map Method
IKI a-Simplification of Boolean Functions Bobby Nazief Semester-I The materials on these slides are adopted from those in CS231’s Lecture.
Overview Part 2 – Circuit Optimization 2-4 Two-Level Optimization
Boolean Algebra and Digital Circuits
1 Simplification of Boolean Functions:  An implementation of a Boolean Function requires the use of logic gates.  A smaller number of gates, with each.
1 Chapter 5 Karnaugh Maps Mei Yang ECG Logic Design 1.
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.
1 Digital Logic Design Week 5 Simplifying logic expressions.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. Circuit Optimization Logic and Computer Design Fundamentals.
Circuit Minimization. It is often uneconomical to realize a logic directly from the first logic expression that pops into your head. Canonical sum and.
Computer Engineering (Logic Circuits) (Karnaugh Map)
CHAPTER 3: PRINCIPLES OF COMBINATIONAL LOGIC
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
LOGIC GATES & BOOLEAN ALGEBRA
CS1Q Computer Systems Lecture 7
Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 3 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
February 2, 2004CS 2311 Karnaugh maps Last time we saw applications of Boolean logic to circuit design. – The basic Boolean operations are AND, OR and.
June 11, 2002© Howard Huang1 Boolean algebra Last time we talked about Boolean functions, Boolean expressions, and truth tables. Today we’ll learn.
Karnaugh Maps (K-Maps)
CS231 Boolean Algebra1 Summary so far So far: – A bunch of Boolean algebra trickery for simplifying expressions and circuits – The algebra guarantees us.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
June 12, 2002© Howard Huang1 Karnaugh maps Last time we saw applications of Boolean logic to circuit design. – The basic Boolean operations are.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
THE K-MAP.
EE2420 – Digital Logic Summer II 2013 Hassan Salamy Ingram School of Engineering Texas State University Set 5: Karnaugh Maps.
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.
CS231 Boolean Algebra1 Circuit analysis summary After finding the circuit inputs and outputs, you can come up with either an expression or a truth table.
Mu.com.lec 9. Overview Gates, latches, memories and other logic components are used to design computer systems and their subsystems Good understanding.
CE1110: Digital Logic Design Gate Level Minimization Karnaugh Maps (K-Maps)
CHAPTER 3 Simplification of Boolean Functions
Lecture 04 – Logic and circuits
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
Prof. Sin-Min Lee Department of Computer Science
Lecture 5 Topics Canonical or Standard Forms of Functions
CS 352 Introduction to Logic Design
Dr. Clincy Professor of CS
Circuit analysis summary
Boolean algebra Last time we talked about Boolean functions, Boolean expressions, and truth tables. Today we’ll learn how to how use Boolean algebra to.
ECE 2110: Introduction to Digital Systems
Lecture 3 Gunjeet Kaur Dronacharya Group of Institutions
Karnaugh Maps.
Digital Logic and Design
17-Nov-18 Logic Algebra 1 Combinational logic.
Optimized Implementation of Logic Function
BASIC & COMBINATIONAL LOGIC CIRCUIT
Karnaugh Maps Topics covered in this presentation: Karnaugh Maps
Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: We can represent.
Reading: Hambley Ch. 7 through 7.5
SYEN 3330 Digital Systems Chapter 2 – Part 5 SYEN 3330 Digital Systems.
COE 202: Digital Logic Design Combinational Logic Part 3
Dr. Clincy Professor of CS
CS Chapter 3 (3A and ) – Part 3 of 5
Dr. Clincy Professor of CS
From now on: Combinatorial Circuits:
Overview Part 2 – Circuit Optimization
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Chapter 3 Special Section
Karnaugh maps Last time we saw applications of Boolean logic to circuit design. The basic Boolean operations are AND, OR and NOT. These operations can.
Analysis of Logic Circuits Example 1
Basic circuit analysis and design
Circuit Simplification and
Presentation transcript:

Lecture 5 Dr. Nermin Hamza

Karnaugh Maps for Two-Level Size Minimization yz Easy to miss “seeing” possible opportunities to combine terms Karnaugh Maps (K-maps) Graphical method to help us find opportunities to combine terms Minterms differing in one variable are adjacent in the map Can clearly see opportunities to combine terms – look for adjacent 1s For F, clearly two opportunities Top left circle is shorthand for x’y’z’+x’y’z = x’y’(z’+z) = x’y’(1) = x’y’ Draw circle, write term that has all the literals except the one that changes in the circle Circle xy, x=1 & y=1 in both cells of the circle, but z changes (z=1 in one cell, 0 in the other) Minimized function: OR the final terms Notice not in binary order x 00 01 11 10 K-map x’y’z’ x’y’z x’yz x’yz’ xy’z’ xy’z xyz xyz’ a Treat left & right as adjacent too 1 F = x’y’z + xyz + xyz’ + x’y’z’ 1 1 1 1 00 01 11 10 1 F yz x a 1 00 01 11 10 F yz x x ’ y a x y F = x’y’ + xy Easier than all that algebra: F = xyz + xyz’ + x’y’z’ + x’y’z F = xy(z + z’) + x’y’(z + z’) F = xy*1 + x’y’*1 F = xy + x’y’

K-maps Four adjacent 1s means two variables can be eliminated Makes intuitive sense – those two variables appear in all combinations, so one must be true Draw one big circle – shorthand for the algebraic transformations above G = xy’z’ + xy’z + xyz + xyz’ G = x(y’z’+ y’z + yz + yz’) (must be true) G = x(y’(z’+z) + y(z+z’)) G = x(y’+y) G = x Draw the biggest circle possible, or you’ll have more terms than really needed

K-maps Four adjacent cells can be in shape of a square OK to cover a 1 twice Just like duplicating a term Remember, c + d = c + d + d No need to cover 1s more than once Yields extra terms – not minimized H = x’y’z + x’yz + xy’z + xyz (xy appears in all combinations) a 1 00 01 11 10 I yz x y ’ z The two circles are shorthand for: I = x’y’z + xy’z’ + xy’z + xyz + xyz’ I = x’y’z + xy’z + xy’z’ + xy’z + xyz + xyz’ I = (x’y’z + xy’z) + (xy’z’ + xy’z + xyz + xyz’) I = (y’z) + (x) a a

K-maps Circles can cross left/right sides Remember, edges are adjacent Minterms differ in one variable only Circles must have 1, 2, 4, or 8 cells – 3, 5, or 7 not allowed 3/5/7 doesn’t correspond to algebraic transformations that combine terms to eliminate a variable Circling all the cells is OK Function just equals 1

Simplify using k- map F(x,y,z)= ∑ (2,3,4,5) Solution is : X’Y+XY’

Simplify using k- map F(x,y,z)= ∑ (3,4,6,7) Solution is : XZ’+YZ

Simplify using k- map F(x,y,z)= ∑ (0,2,4,5,6) Solution is : Z’+XY’

Simplify using k- map F(x,y,z)= ∑ (0,2,4,5,6) Solution is : Z’+XY’

Simplify using k- map F(X,Y,Z)= ∑ (1,2,3,5,7) Solution is : Z+X’Y

K-maps for Four Variables Four-variable K-map follows same principle Adjacent cells differ in one variable Left/right adjacent Top/bottom also adjacent 5 and 6 variable maps exist But hard to use Two-variable maps exist But not very useful – easy to do algebraically by hand F=w’xy’+yz 1 F z y G=z

Simplify using k- map F(W,X,Y,Z)= ∑ (0,1,2,4,5,6,8,9,12,13,14) Solution is : Y’+W’Z’+XZ’

Simplify using k- map F(W,X,Y,Z)= ∑ (3,7,11,12,13,15) Solution is : YZ+WXY’

F= A’B ‘C’+B’CD’+A’BCD’+AB’C’ Solution: B’C’+A’CD’+AB’D’

Don’t Care Conditions In many application it is known in advance that some of the input combinations will never occur. These combinations are marked as “Don’t Care Conditions” and are used as either zero’s or one’s so that the application is implemented with the most simplified circuit. Example: Simplify the logic expression X(A,B,C,D) with the don’t care conditions d(A,B,C,D).

On K-map – Draw Xs for don’t care combinations • Include X in circle ONLY if minimizes equation • Don’t include other Xs

Don’t Care Conditions In many application it is known in advance that some of the input combinations will never occur. These combinations are marked as “Don’t Care Conditions” and are used as either zero’s or one’s so that the application is implemented with the most simplified circuit. Example: Simplify the logic expression X(A,B,C,D) with the don’t care conditions d(A,B,C,D).

Don’t Care Input Combinations What if particular input combinations can never occur? e.g., Minimize F = xy’z’, given that x’y’z’ (xyz=000) can never be true, and that xy’z (xyz=101) can never be true So it doesn’t matter what F outputs when x’y’z’ or xy’z is true, because those cases will never occur Thus, make F be 1 or 0 for those cases in a way that best minimizes the equation On K-map Draw Xs for don’t care combinations Include X in circle ONLY if minimizes equation Don’t include other Xs Good use of don’t cares Unnecessary use of don’t cares; results in extra term