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.

Slides:



Advertisements
Similar presentations
Techniques for Combinational Logic Optimization
Advertisements

Introduction to Logic Gates
Chapter3: Gate-Level Minimization Part 2
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 1 Combinational Circuit – Arithmetic Circuit Parallel Adder Example: 4-bit adder.
Gate-Level Minimization
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.
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.
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR
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.

ECE 301 – Digital Electronics Karnaugh Maps and Determining a Minimal Cover (Lecture #8) The slides included herein were taken from the materials accompanying.
بهينه سازي با نقشة کارنو Karnaugh Map. 2  Method of graphically representing the truth table that helps visualize adjacencies 2-variable K-map 3-variable.
SYEN 3330 Digital Systems Jung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 5.
Simplifying Boolean Expressions Using K-Map Method
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR1 Sequential Circuit Design.
Overview Part 2 – Circuit Optimization 2-4 Two-Level Optimization
Digital Logic and Design Vishal Jethva Lecture No. 10 svbitec.wordpress.com.
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 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.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.
1 Digital Logic Design Week 5 Simplifying logic expressions.
Optimization Algorithm
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. Circuit Optimization Logic and Computer Design Fundamentals.
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.
Combinational Logic Part 2: Karnaugh maps (quick).
Converting to Minterms Form
Computer Engineering (Logic Circuits) (Karnaugh Map)
Chapter3: Gate-Level Minimization Part 1 Origionally By Reham S. Al-Majed Imam Muhammad Bin Saud University.
Chapter 3 The Karnaugh Map
CS2100 Computer Organisation
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
Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 3 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
Prof. Hsien-Hsin Sean Lee
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
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
ECE/CS 352 Digital System Fundamentals1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 2 – Part 5 Tom Kaminski & Charles R. Kime.
1 Gate Level Minimization EE 208 – Logic Design Chapter 3 Sohaib Majzoub.
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
Karnaugh Maps (K maps).
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.
1 EENG 2710 Chapter 3 Simplification of Switching Functions.
Technical Seminar II Implementation of
Counters & Sequential Circuit Design
ECE 2110: Introduction to Digital Systems
Computer Organisation
Plotting functions not in canonical form
EEL 3705 / 3705L Digital Logic Design
Optimization Algorithm
Karnaugh Maps Introduction Venn Diagrams 2-variable K-maps
SYEN 3330 Digital Systems Chapter 2 – Part 5 SYEN 3330 Digital Systems.
Chapter 3 Gate-level Minimization.
Minimization of Switching Functions
Overview Part 2 – Circuit Optimization
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Simplification of Boolean Functions using K-Maps
Presentation transcript:

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 minterm combination from a square next to K-map Use largest possible cluster

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 2 Simplification of SOP Expression No extra cluster

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 3 Simplification of SOP Expression Algorithm 1 1.Count adjacent minterm number for each minterm in K-map 2.Choose uncovered minterm with the least adjacent minterm number. Choose only one if more than one exist 3.Execute PI for that minterm and placed inside a loop. If the minterm has been looped with more than one PI, choose PI with the most minterm number 4.Repeat step 2 and 3 until all minterm is looped

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 4 Simplification of SOP Expression Algorithm 2 1.Looped all PI in the K-map 2.Determine and choose all EPI to be looped 3.Choose minimum subset for the remained PI to complete the loop (which used to loop minterm which is not looped by the EPI)

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 5 Simplification of SOP Expression Example

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 6 Simplification of SOP Expression

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 7 Simplification of SOP Expression

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 8 Obtaining POS Expression Simplified POS expression can be obtained by collecting maxter (I.e. 0) for the given function. Example Given F=  m(0,1,2,3,5,7,8,9,10,11), we start with draw K-map, then cluster the maxterm

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 9 Obtaining POS Expression Given SOP for F’ is: To obtain POS for F, we do:

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 10 Don’t Care Condition In certain problems, some of the output is not determined The output can be ‘1’ or ‘0’ This is known as don’t care which is mark by X Example: In odd parity executor for BCD code, 6 is not used

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 11 Don’t Care Condition Don’t care condition can be used to help us in simplifying Boolean expression in K- map It can be ‘1’ or ‘0’ depends on which expression is simpler

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 12 Don’t Care Condition As a comparison –Without don’t cares –With don’t cares

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 13 Simplification of SOP Expression Example 1

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 14 Simplification of SOP Expression Example 1

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 15 Simplification of SOP Expression Example 1

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 16 Simplification of SOP Expression Example 1

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 17 Simplification of SOP Expression Example 1

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 18 Simplification of SOP Expression Example 2

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 19 Simplification of SOP Expression Example 2

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 20 Simplification of SOP Expression Example 2

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 21 Simplification of SOP Expression Example 3

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 22 Simplification of POS Expression To obtain POS expression for example 2 Draw K-map for f complement which is f’

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 23 Simplification of POS Expression To obtain POS expression for example 3 Draw K-map for f complement which is f’