Introduction to Digital Electronics Lecture 5: Function Minimisation.

Slides:



Advertisements
Similar presentations
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Advertisements

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals with PLD Programming.
ECE 301 – Digital Electronics Karnaugh Maps (Lecture #7) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,
Digital Fundamentals Floyd Chapter 4 Tenth Edition
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
ECE 331 – Digital System Design Karnaugh Maps and Determining a Minimal Cover (Lecture #7) The slides included herein were taken from the materials accompanying.
Digital Fundamentals with PLD Programming Floyd Chapter 4
Computer Organization and Assembly Language: Chapter 7 The Karnaugh Maps September 30, 2013 By Engineer. Bilal Ahmad.
Computer Programming Skills Revision Prepared by: Ghader Kurdi.
Digital Logic Design Adil Waheed. BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION AND gate F = A.B OR gate F = A + B NOT gate F = A NAND gate F = A.B NOR gate.
Boolean Algebra and Logic Simplification
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals with PLD Programming.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
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.
Minimisation ENEL111. Minimisation Last Lecture  Sum of products  Boolean algebra This Lecture  Karnaugh maps  Some more examples of algebra and truth.
Based on slides by:Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 6 – Canonical Forms.
CH41 Chapter 4 Boolean Algebra and Logic Simplification By Taweesak Reungpeerakul.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 5 © 2008 Pearson Education.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Pp244 In Sum-of-Products (SOP) form, basic.
Fundamentals of digital electronics Prepared by - Anuradha Tandon Assistant Professor, Instrumentation & Control Engineering Branch, IT, NU.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 4 © 2008 Pearson Education.
CS151 Introduction to Digital Design Chapter Map Simplification.
Chapter 2 Boolean Algebra and Minimization Techniques.
Sum-of-Products (SOP)
DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
Digital Logic Design Dr. Oliver Faust Chapter 4
THE K-MAP.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Binary Numbers For digital systems, the.
 Seattle Pacific University EE Logic System DesignKMaps-1 Two-Level Simplification All Boolean expressions can be represented in two- level forms.
Logic Simplification-Using K-Maps
1 3- De-Morgan’s Theorems 1.The complement of a product of variables is equal to the sum of the complements of the variables. 2. The complement of a sum.
Introduction to Digital Electronics Lecture 2: Number Systems.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
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.
In some Boolean functions there are some input terms that will never occur, for example in BCD code there are sex invalid combinations 1010,1011,1100,
DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.
DeMorgan’s Theorem DeMorgan’s 2 nd Theorem The complement of a sum of variables is equal to the product of the complemented variables. A + B = A. B Applying.
Based on slides by:Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 7 – Karnaugh Maps.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Introduction to Digital Electronics Lecture.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC:K-Map. K-Map (1)  Karnaugh Map provides a systematic method for simplifying Boolean expressions and may produce.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Combinational Circuits Part 1
Digital Fundamentals Floyd Chapter 5 Tenth Edition
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
Digital Fundamentals Floyd Chapter 5 Tenth Edition
BASIC & COMBINATIONAL LOGIC CIRCUIT
Karnaugh Maps Topics covered in this presentation: Karnaugh Maps
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 4 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Chapter 5 Combinational Logic Analysis
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Combinational Logic Circuit
Laws & Rules of Boolean Algebra
Presentation transcript:

Introduction to Digital Electronics Lecture 5: Function Minimisation

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed SOP and POS forms Boolean expressions can be written in the sum-of-products form (SOP) or in the product-of-sums form (POS). These forms can simplify the implementation of combinational logic, particularly with PLDs. In both forms, an overbar cannot extend over more than one variable. An expression is in SOP form when two or more product terms are summed as in the following examples: An expression is in POS form when two or more sum terms are multiplied as in the following examples: A B C + A B A B C + C DC D + E (A + B)(A + C) (A + B + C)(B + D) (A + B)C

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed SOP Standard form In SOP standard form, every variable in the domain must appear in each term. This form is useful for constructing truth tables or for implementing logic in PLDs. You can expand a nonstandard term to standard form by multiplying the term by a term consisting of the sum of the missing variable and its complement. Convert X = A B + A B C to standard form. The first term does not include the variable C. Therefore, multiply it by the (C + C), which = 1: X = A B (C + C) + A B C = A B C + A B C + A B C

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed POS Standard form In POS standard form, every variable in the domain must appear in each sum term of the expression. You can expand a nonstandard POS expression to standard form by adding the product of the missing variable and its complement and applying rule 12, which states that (A + B)(A + C) = A + BC. Convert X = (A + B)(A + B + C) to standard form. The first sum term does not include the variable C. Therefore, add C C and expand the result by rule 12. X = (A + B + C C)(A + B + C) = (A +B + C )(A + B + C)(A + B + C)

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed The Karnaugh map (K-map) is a tool for simplifying combinational logic with 3 or 4 variables. For 3 variables, 8 cells are required (2 3 ). The map shown is for three variables labeled A, B, and C. Each cell represents one possible product term. Each cell differs from an adjacent cell by only one variable. Karnaugh maps

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Cells are usually labeled using 0’s and 1’s to represent the variable and its complement. Gray code Karnaugh maps Ones are read as the true variable and zeros are read as the complemented variable. The numbers are entered in gray code, to force adjacent cells to be different by only one variable.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed AB C Alternatively, cells can be labeled with the variable letters. This makes it simple to read, but it takes more time preparing the map. Karnaugh maps Read the terms for the yellow cells. The cells are ABC and ABC.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed 1. Group the 1’s into two overlapping groups as indicated. 2.Read each group by eliminating any variable that changes across a boundary. 3.The vertical group is read AC. K-maps can simplify combinational logic by grouping cells and eliminating variables that change. Karnaugh maps Group the 1’s on the map and read the minimum logic. B changes across this boundary C changes across this boundary 4.The horizontal group is read AB. X = AC +AB

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed A 4-variable map has an adjacent cell on each of its four boundaries as shown. Each cell is different only by one variable from an adjacent cell. Grouping follows the rules given in the text. The following slide shows an example of reading a four variable map using binary numbers for the variables… Karnaugh maps

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed X Karnaugh maps Group the 1’s on the map and read the minimum logic. 1. Group the 1’s into two separate groups as indicated. 2.Read each group by eliminating any variable that changes across a boundary. 3.The upper (yellow) group is read as AD. 4.The lower (green) group is read as AD. X = AD +AD B changes C changes B changes C changes across outer boundary

1. A Boolean expression that is in standard SOP form is a. the minimum logic expression b. contains only one product term c. has every variable in the domain in every term d. none of the above © 2008 Pearson Education

2. Adjacent cells on a Karnaugh map differ from each other by a. one variable b. two variables c. three variables d. answer depends on the size of the map

© 2008 Pearson Education 3. The minimum expression that can be read from the Karnaugh map shown is a. X = A b. X = A c. X = B d. X = B

© 2008 Pearson Education 4. The minimum expression that can be read from the Karnaugh map shown is a. X = A b. X = A c. X = B d. X = B

Answers: 1. c 2. a 3. a 4. d