KARNAUGH MAP Introduction Strategy for Minimization Minimization of Product-of-Sums Forms Minimization of More Complex Expressions Don't care Terms 1.

Slides:



Advertisements
Similar presentations
Techniques for Combinational Logic Optimization
Advertisements

Prof. Sin-Min Lee Department of Computer Science
Logical Systems Synthesis.
Morgan Kaufmann Publishers
ECE 3110: Introduction to Digital Systems Simplifying Sum of Products using Karnaugh Maps.
Chapter 3 Simplification of Switching Functions. Karnaugh Maps (K-Map) A K-Map is a graphical representation of a logic function’s truth table.
Gate-level Minimization
Chapter 3 Simplification of Switching Functions
Canonical Forms and Logic Miniminization
ECE 331 – Digital System Design Karnaugh Maps and Determining a Minimal Cover (Lecture #7) The slides included herein were taken from the materials accompanying.
ECE 301 – Digital Electronics Karnaugh Maps and Determining a Minimal Cover (Lecture #8) The slides included herein were taken from the materials accompanying.
Simplifying Boolean Expressions Using K-Map Method
Overview Part 2 – Circuit Optimization 2-4 Two-Level Optimization
Switching functions The postulates and sets of Boolean logic are presented in generic terms without the elements of K being specified In EE we need to.
ECE 331 – Digital System Design
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 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.
Department of Computer Engineering
Chapter 3: Digital Logic Dr Mohamed Menacer Taibah University
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
Karnaugh map minimization Basic Terms (1) minterm maxterm - a single 1 - a single 0 1. implicant
ECE 3110: Introduction to Digital Systems Symplifying Products of sums using Karnaugh Maps.
UM EECS 270 Spring 2011 – Taken from Dr.Karem Sakallah Logic Synthesis: From Specs to Circuits Implementation Styles –Random –Regular Optimization Criteria.
Combinational Logic Part 2: Karnaugh maps (quick).
Unit 5 Karnaugh Maps Fundamentals of Logic Design by Roth and Kinney.
Circuit Minimization. It is often uneconomical to realize a logic directly from the first logic expression that pops into your head. Canonical sum and.
Boolean Algebra Introduction Logical arguments are valid (or not) by virtue of their form, not content Example All men are mortal(premise 1) Harry is a.
Chapter 2 Two- Level Combinational Logic. Chapter Overview Logic Functions and Switches Not, AND, OR, NAND, NOR, XOR, XNOR Gate Logic Laws and Theorems.
Chapter3: Gate-Level Minimization Part 1 Origionally By Reham S. Al-Majed Imam Muhammad Bin Saud University.
07 KM Page 1 ECEn/CS 224 Karnaugh Maps. 07 KM Page 2 ECEn/CS 224 What are Karnaugh Maps? A simpler way to handle most (but not all) jobs of manipulating.
CHAPTER 3: PRINCIPLES OF COMBINATIONAL LOGIC
Simplification of switching functions Simplify – why? –Switching functions map to switching circuits –Simpler function  simpler circuit –Reduce hardware.
ece Parity Used to check for errors Can be either ODD or EVEN Left most bit used as the indicator For EVEN, insert a 0 or a 1 so as to make the.
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
BR 2/1/991 Truth Tables (again) Recall that a boolean equation can be represented by a Truth Table A B C F
Karnaugh Maps (K-Map) A K-Map is a graphical representation of a logic function’s truth table.
C.S.Choy39 TERMINOLOGY Minterm –product term containing all input variables of a function in either true or complementary form Maxterm – sum term containing.
1 Example: Groupings on 3-Variable K-Maps BC F(A,B,C) = A ’ B ’ A BC F(A,B,C) = B ’ A
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
Lecture # 5 University of Tehran
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.
Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.
Digital Logic & Design Dr. Waseem Ikram Lecture 09.
ECE 2110: Introduction to Digital Systems
Computer Organisation
ECE 3110: Introduction to Digital Systems
ECE 2110: Introduction to Digital Systems
Karnaugh Maps.
ECE 331 – Digital System Design
CSE140 HW2 Preparation Xinyuan Wang 04/20/2018.
ECE 331 – Digital System Design
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
Karnaugh Mapping Karnaugh Mapping Digital Electronics
Karnaugh Mapping Digital Electronics
ECE 331 – Digital System Design
Karnaugh Mapping Karnaugh Mapping Digital Electronics
Karnaugh Mapping Digital Electronics
Minimization of Switching Functions
CS Chapter 3 (3A and ) – Part 3 of 5
Overview Part 2 – Circuit Optimization
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Karnaugh Map Method By: Asst Lec. Besma Nazar Nadhem
ECE 331 – Digital System Design
Computer Architecture
Presentation transcript:

KARNAUGH MAP Introduction Strategy for Minimization Minimization of Product-of-Sums Forms Minimization of More Complex Expressions Don't care Terms 1

Introduction Why karnaugh map Example (With Boolean algebra) 2

Introduction ( cont. ) Using Boolean algebra for minimization causes it’s own problem because of it mainly being a trial and error process, and we can almost never be sure that we have reached a minimal representation. If we can form a graphical notation for our Boolean algebra the insight need for the minimization will be less vital in solving the problems. We can come close to our aim by using a graphical notation named Karnaugh Map that will be defined in next slides 3

Introduction ( cont. ) Comparing Karnaugh Map and Boolean Algebra ABW Truth Table B A W Karnaugh Map 4 As it can be seen, each box of the Karnaugh map corresponds to a row of the truth table and has been numbered accordingly This form of representing w in the following example is called a Sum of Product (SOP) Which will be define in next slides

Strategy for Minimization Terminology Minimization Procedure 5

Terminology Implicant : Product term that implies function Prime Implicant : An Implicant that is not completely covered by any other Implicant but itself Essential prime Implicant : A prime Implicant that has a minter not covered by any other prime Implicant Product term : An and expression 6

Terminology Minterm : We define a Minterm to be a product that contains all variables of that particular switching function in either complemented or non-complemented form Maxterm : We define a Maxterm to be a sum that contains all variables of that particular switching function in either complemented or non-complemented form Standard SOP(Sum Of Products) : In standard SOP, the products are obtained directly from the Karnaugh map or truth table, so the SOP contains all of the variables of the function Standard POS(Product Of Sums) : In standard POS, the products are obtained directly from the Karnaugh map or truth table, so the POS contains all of the variables of the function 7

Terminology ( cont. ) A simpler shorthand form of representing a SOP is to use the number of the Minterms that appear in that representation. In the following example for instance we could have written Karnaugh Map AB C

Terminology ( cont. ) Sometimes writing an expression in a POS form is easier as seen in the following example: Karnaugh Map AB C 9

Strategy for Minimization Terminology Minimization Procedure 10