MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Slides:



Advertisements
Similar presentations
Techniques for Combinational Logic Optimization
Advertisements

Prof. Sin-Min Lee Department of Computer Science
K-Map Simplification COE 202 Digital Logic Design Dr. Aiman El-Maleh
Based on slides by: Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 8 – Systematic Simplification.
1 Combinational Logic Network design Chapter 4 (continued ….)
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.
ECE 301 – Digital Electronics Karnaugh Maps (Lecture #7) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,
SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 4.
Examples Simplify: ab’c + abc + a’bc Show that X + X’Y = X + Y
Chapter 3 Simplification of Switching Functions
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 1 Combinational Circuit – MSI Circuit ENCODER With the aid of K-map (don’t care situation), we can get D 0 =
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 1 Boolean Function Boolean function is an expression form containing binary variable, two-operator binary which.
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 1 Simplification of SOP Expression Prime Implicant (PI) is a product which is obtained from the number of maximum.

Computer Engineering (Logic Circuits) (Karnaugh Map)
بهينه سازي با نقشة کارنو Karnaugh Map. 2  Method of graphically representing the truth table that helps visualize adjacencies 2-variable K-map 3-variable.
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
K-map Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
1 Simplification of Boolean Functions:  An implementation of a Boolean Function requires the use of logic gates.  A smaller number of gates, with each.
CT455: Computer Organization K-Map
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 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.
CS2100 Computer Organisation
K-Maps. Outline  2-variable K-maps  3-variable K-maps  4-variable K-maps  5-variable and larger K-maps.
CS1104: Computer Organisation comp. nus. edu
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
Examples. Examples (1/11)  Example #1: f(A,B,C,D) =  m(2,3,4,5,7,8,10,13,15) Fill in the 1’s. 1 1 C A B CD AB D 1 1.
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.
Converting to Minterms Form
Gate-Level Minimization
Chapter 2 Two- Level Combinational Logic. Chapter Overview Logic Functions and Switches Not, AND, OR, NAND, NOR, XOR, XNOR Gate Logic Laws and Theorems.
Computer Engineering (Logic Circuits) (Karnaugh Map)
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
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 3 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Karnaugh Mapping Digital Electronics. Karnaugh Mapping or K-Mapping This presentation will demonstrate how to Create and label two, three, & four variable.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 4 © 2008 Pearson Education.
Prof. Hsien-Hsin Sean Lee
June 12, 2002© Howard Huang1 Karnaugh maps Last time we saw applications of Boolean logic to circuit design. – The basic Boolean operations are.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
KARNAUGH MAP A Karnaugh map (K Map) is a pictorial method used to minimize boolean expressions without having to use boolean algebra theorems and equation.
Karnaugh Maps (K-Map) A K-Map is a graphical representation of a logic function’s truth table.
K-map Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
Function Simplification. Outline  Function Simplification  Algebraic Simplification  Half Adder  Introduction to K-maps  Venn Diagrams.
Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC:K-Map. K-Map (1)  Karnaugh Map provides a systematic method for simplifying Boolean expressions and may produce.
Digital Logic & Design Dr. Waseem Ikram Lecture 09.
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
Computer Organisation
Plotting functions not in canonical form
ECE/CS 352 Digital Systems Fundamentals
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
SYEN 3330 Digital Systems Chapter 2 – Part 4 SYEN 3330 Digital Systems.
ECE 331 – Digital System Design
Karnaugh Maps Introduction Venn Diagrams 2-variable K-maps
Chapter 3 Gate-level Minimization.
Minimization of Switching Functions
Overview Part 2 – Circuit Optimization
Analysis of Logic Circuits Example 1
Laws & Rules of Boolean Algebra
Presentation transcript:

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Karnaugh Map Introduction Venn Diagram 2 variable K-map 3 variable K-map 4 variable K-map K-map simplification MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Karnaugh Map Convert to Minterm Form Simplest SOP expression Produce POS expression Don’t care condition MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map -Introduction Systematic method to get simplest Boolean SOP expression Objective: Minimum number of literal Dramatic technique based on special Venn Diagram Form Advantage: Easy with visual aid Disadvantage: Limited to five or six variables MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map – Venn Diagram Venn Diagram represent minterm space Example: two variables (4 minterm) MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map – Venn Diagram Each minterm set represent Boolean function Example: MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map – 2 variable K-map is abstract form, Venn diagram is arranged as square matrix, where Each square represent one minterm Adjacent square is always differentiated with one literal (therefore theorem a+a’ can be used) For two variable case (e.g. variable a, b), map can be drawn as MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map – 2 variable Map form that can be drawn for 2 variable (a,b) MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map – 2 variable Map form that can be drawn for 2 variable (a,b) – cont.. MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map – 2 variable Equivalent labeling method MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map – 2 variable K-map for a function is determined by placing sign 1 on equivalent square with minterm 0 vice versa For example: Carry & Sum for half adder MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map – 3 variable There are 8 minterm for three variable (a,b,c). Therefore, 8 cell in three variable K-map The above array ensure that minterm in adjacent cell only has one literal difference MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map – 3 variable There are wrap-around in 3 variable K-map a’b’c’(m0) is as neighbor next to a’bc’(m2) ab’c’(m4) is as neighbor next to abc’(m6) Each cell in 3 variable K-map contains three adjacent neighbor. Generally, each cell in K-map n variable contain n adjacent neighbor. MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map – 4 variable There are 16 cell in 4 variable K-map (w,x,y,z) MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map – 4 variable There are 2 wrap-around: vertical & horizontal Each cell has 4 adjacent neighbor. For example: cell m0 is a neighbor of m1, m2, m4 and m8 MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map – 5 variable Map for more than 4 variable are more complicated since the geometry (hypercube configuration) for adjacent neighbor is greater. For five variable; e.g. vwxyz there is 25=32 squares MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Karnaugh Map – 5 variable It is arrange similar to 4 variable K-map Similar square on each adjacent map MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Simplification using Karnaugh Map Based on Theorem: A+A’=1 In K-map, each cell contains ‘1’ representing minterm for the given function Each adjacent cell cluster contains ‘1’ (the cluster must have a power of two size which is 1,2,4,8….) then get the simplified value for each cluster grouped 2 adjacent squares will eliminate 1 variable, grouped 4 adjacent squares will eliminate 2 variable, grouped 8 adjacent squares will eliminate 3 variable, grouped 2n adjacent squares will eliminate n variable, MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Simplification using Karnaugh Map Grouped largest possible squares (minterm) in a cluster The grater the cluster, the lesser the number of literals in your answer Get the number of small cluster to gather all squares (minterm) for the function The lesser the cluster, the lesser the number of ‘product’ and the minimize function MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Simplification using Karnaugh Map Example: MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Simplification using Karnaugh Map Get the ‘product’ for each cluster for adjacent minterm (cluster with power of two size) for given function. Example: MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Simplification using Karnaugh Map There are two minterm cluster A and B where (for previous example) MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Simplification using Karnaugh Map Each ‘product’ for cluster, w’xy’ and wy represent sum-of-minterm in that cluster Boolean Function is sum-of-product which represent all minterm cluster for that function F(w,x,y,z)=A+B=w’xy’+wy MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Simplification using Karnaugh Map Greater cluster produce ‘product’ with small number of literal. In 4 variable K-map case: 1 cell = 4 literal, example: wxyz, w’xy’z 2 cell = 3 literal, example: wxy, w’y’z’ 4 cell = 2 literal, example: wx, x’y 8 cell = 1 literal, example: w, y’, z’ 16 cell = no literal example: 1 MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Simplification using Karnaugh Map Other types of cluster in 4 variable K-map case are: MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Simplification using Karnaugh Map Minterm cluster must be Square, and Power of two size If not, it is not a certified cluster. Examples of non certified cluster are MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Conversion to Minterm Form Function is easy to draw in K-map when function is given in SOP or SOM canonical form How if it is not in sum-of-minterm form? Convert it to sum-of-product Elaborate SOP expression to SOM expression, or fill SOP expression directly to K-map MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Conversion to Minterm Form Example: MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

SOP Expression Simplification To get the simplest SOP expression from K-map, you will need Minimum number of literal for each ‘product’, and Minimum number of ‘product’ This can be achieved in K-map by using Largest possible number of minterm in one cluster (i.e. prime implicant (PI)) No extra cluster (i.e. essential prime implicant (epi)) Implicant: is a "covering" (sum term or product term) of one or more in a sum of product (or a maxterm in a product of sum) of a boolean function MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR