ECE 301 – Digital Electronics Karnaugh Maps (Lecture #7) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,

Slides:



Advertisements
Similar presentations
Gate-level Minimization
Advertisements

ECE C03 Lecture 21 Lecture 2 Two Level Minimization Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
ECE 301 – Digital Electronics Circuit Design and Analysis (Lecture #9A) The slides included herein were taken from the materials accompanying Fundamentals.
ECE 331 – Digital System Design Boolean Algebra (Lecture #3) The slides included herein were taken from the materials accompanying Fundamentals of Logic.
ECE 301 – Digital Electronics Minterm and Maxterm Expansions and Incompletely Specified Functions (Lecture #6) The slides included herein were taken from.
ECE 331 – Digital System Design
ECE 331 – Digital System Design
CS 140 Lecture 2 Combinational Logic CK Cheng 4/04/02.
SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 4.
1 CS 140 Lecture 3 Combinational Logic Professor CK Cheng CSE Dept. UC San Diego.
1 CS 20 Lecture 14 Karnaugh Maps Professor CK Cheng CSE Dept. UC San Diego.
1 CS 140 Lecture 3 Combinational Logic Professor CK Cheng CSE Dept. UC San Diego.
ECE 301 – Digital Electronics Boolean Algebra and Standard Forms of Boolean Expressions (Lecture #4) The slides included herein were taken from the materials.
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.
CS 151 Digital Systems Design Lecture 8 Minimization with Karnaugh Maps.
بهينه سازي با نقشة کارنو Karnaugh Map. 2  Method of graphically representing the truth table that helps visualize adjacencies 2-variable K-map 3-variable.
Simplifying Boolean Expressions Using K-Map Method
Digital Logic and Design Vishal Jethva Lecture No. 10 svbitec.wordpress.com.
Lecture 3: Incompletely Specified Functions and K Maps CSE 140: Components and Design Techniques for Digital Systems Fall 2014 CK Cheng Dept. of Computer.
Lecture 2 – Boolean Algebra Lecturer: Amy Ching Date: 21 st Oct 2002.
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
KARNAUGH MAP – Digital Circuit 1 Choopan Rattanapoka.
K-map Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
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.
ECE 331 – Digital System Design NAND and NOR Circuits, Multi-level Logic Circuits, and Multiple-output Logic Circuits (Lecture #9) The slides included.
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
ECE 331 – Digital System Design Circuit Design and Analysis (Lecture #9A) The slides included herein were taken from the materials accompanying Fundamentals.
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
Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 3 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
Fundamentals of digital electronics Prepared by - Anuradha Tandon Assistant Professor, Instrumentation & Control Engineering Branch, IT, NU.
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 4 © 2008 Pearson Education.
Karnaugh Maps (K-Maps)
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
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
THE K-MAP.
C.S.Choy39 TERMINOLOGY Minterm –product term containing all input variables of a function in either true or complementary form Maxterm – sum term containing.
 Seattle Pacific University EE Logic System DesignKMaps-1 Two-Level Simplification All Boolean expressions can be represented in two- level forms.
CSE 140: Components and Design Techniques for Digital Systems Lecture 3: Incompletely Specified Functions and K Maps CK Cheng Dept. of Computer Science.
EE2420 – Digital Logic Summer II 2013 Hassan Salamy Ingram School of Engineering Texas State University Set 5: Karnaugh Maps.
Karnaugh Map (K-Map) By Dr. M. Khamis Mrs. Dua’a Al Sinari.
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
K-map Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
Introduction to Digital Electronics Lecture 5: Function Minimisation.
ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)
Figure 5–5 Exclusive-OR logic diagram and symbols. Open file F05-05 to verify the operation. Thomas L. Floyd Digital Fundamentals, 9e Copyright ©2006 by.
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
Based on slides by:Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 7 – Karnaugh Maps.
CEC 220 Digital Circuit Design Minterms and Maxterms Monday, January 26 CEC 220 Digital Circuit Design Slide 1 of 11.
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.
CE1110: Digital Logic Design Gate Level Minimization Karnaugh Maps (K-Maps)
ECE 301 – Digital Electronics
Lecture 3: Incompletely Specified Functions and K Maps
ECE/CS 352 Digital Systems Fundamentals
Boolean Expressions Lecture No. 10.
Karnaugh Maps.
ECE 331 – Digital System Design
SYEN 3330 Digital Systems Chapter 2 – Part 4 SYEN 3330 Digital Systems.
ECE 331 – Digital System Design
ECE 331 – Digital System Design
ECE 331 – Digital System Design
Lecture 3: Incompletely Specified Functions and K Maps
Presentation transcript:

ECE 301 – Digital Electronics Karnaugh Maps (Lecture #7) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design, 6 th Edition, by Roth and Kinney, and were used with permission from Cengage Learning.

Spring 2011ECE Digital Electronics2 Simplification of Logic Functions Logic functions can generally be simplified using Boolean algebra. However, two problems arise: – It is difficult to apply to Boolean algebra laws and theorems in a systematic way. – It is difficult to determine when a minimum solution has been achieved. Using a Karnaugh map is generally faster and easier than using Boolean algebra.

Spring 2011ECE Digital Electronics3 Simplification using Boolean Algebra Given: F(A,B,C) =  m(0, 1, 2, 5, 6, 7) Find: minimum SOP expression Combining terms in one way: Combining terms in a different way:

Spring 2011ECE Digital Electronics4 Karnaugh Maps Like a truth table, a Karnaugh map specifies the value of a function for all combinations of the input variables.

Spring 2011ECE Digital Electronics5 Two-variable K-map m 0 m 2 m 3 m 1 B A row #ABminterm 000m0m0 101m1m1 210m2m2 311m3m3

Spring 2011ECE Digital Electronics6 Two-variable K-map: Example Minterm expansion: F(A,B) =  m(0, 1) = A'B' + A'B Maxterm expansion: F(A,B) =  (2, 3) = (A'+B).(A'+B') numericalgebraic row #ABF

Spring 2011ECE Digital Electronics7 Three-variable K-map row #AB C minterm m0m m1m m2m2 3011m3m3 4100m4m4 5101m5m5 6110m6m m7m7 m 0 m 4 m 5 m 1 BC A m 3 m 7 m 6 m Gray Code

Spring 2011ECE Digital Electronics8 Three-variable K-map: Example Minterm expansion: F(A,B,C) =  m(2, 3, 4, 6) Maxterm expansion: F(A,B,C) =  (0, 1, 5, 7) row #ABCF

Spring 2011ECE Digital Electronics9 Minimization using K-maps K-maps can be used to derive the  Minimum Sum of Products (SOP) expression  Minimum Product of Sums (POS) expression Procedure:  Enter functional values in the K-map  Identify adjacent cells with same logical value Adjacent cells differ in only one bit  Use adjacency to minimize logic function Horizontal and Vertical adjacency K-map wraps from top to bottom and left to right

Spring 2011ECE Digital Electronics10 Minimization using K-maps Logical Adjacency is used to  Reduce the number number of literals in a term  Reduce the number of terms in a Boolean expression. The adjacent cells  Form a rectangle  Must be a power of 2 (e.g. 1, 2, 4, 8, …) The greater the number of adjacent cells that can be grouped together (i.e. the larger the rectangle), the more the function can be reduced.

Spring 2011ECE Digital Electronics11 K-maps – Logical Adjacency Gray code

Spring 2011ECE Digital Electronics12 Minimization: Example #1 Minimize the following logic function using a Karnaugh map: F(A,B,C) =  m(2, 6, 7) Specify the equivalent maxterm expansion.

Spring 2011ECE Digital Electronics13 Minimization: Example #2 Minimize the following logic function using a Karnaugh map: F(A,B,C) =  M(1, 3, 5, 6, 7) Specify the equivalent minterm expansion.

Spring 2011ECE Digital Electronics14 Minimization: Example #3 Use a Karnaugh map to determine the 1. minimum SOP expression 2. minimum POS expression For the following logic function: F(A,B,C) =  m(0, 1, 5, 7) Specify the equivalent maxterm expansion.

Spring 2011ECE Digital Electronics15 Minimization: Example #4 Use a Karnaugh map to determine the 1. minimum SOP expression 2. minimum POS expression For the following logic function: F(A,B,C) =  M(0, 1, 5, 7) Specify the equivalent minterm expansion.

Spring 2011ECE Digital Electronics16 Minimization: Example #5 For the following truth table: #ABC F

Spring 2011ECE Digital Electronics17 Example #5 Specify the: 1. minterm expansion 2. maxterm expansion Use a K-map to determine the: 1. minimum SOP expression 2. minimum POS expression

Spring 2011ECE Digital Electronics18 Minimization: Example #6 For the following truth table: #ABC F

Spring 2011ECE Digital Electronics19 Example #6 Specify the: 1. minterm expansion 2. maxterm expansion Use a K-map to determine the: 1. minimum SOP expression 2. minimum POS expression

Spring 2011ECE Digital Electronics20 Minimal Forms Can a logic function have more than one minimum SOP expression? Can a logic function have more than one minimum POS expression?

Spring 2011ECE Digital Electronics21 K-maps – Two minimal forms F(A,B,C) =  m(0,1,2,5,6,7) =  M(3,4)

Spring 2011ECE Digital Electronics22 Questions?