CHAPTER 5 KARNAUGH MAPS

Similar documents
UNIT 5 KARNAUGH MAPS Spring 2011

Logic Design I (17.341) Fall Lecture Outline

Karnaugh Maps Objectives

Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps

Lecture 7: Karnaugh Map, Don t Cares

Advanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011

CHAPTER III BOOLEAN ALGEBRA

CHAPTER 3 BOOLEAN ALGEBRA

Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions

CHAPTER III BOOLEAN ALGEBRA

Simplification of Boolean Functions. Dept. of CSE, IEM, Kolkata

COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 1 of 12

Midterm1 Review. Jan 24 Armita

Optimizations and Tradeoffs. Combinational Logic Optimization

CSE 140: Components and Design Techniques for Digital Systems

This form sometimes used in logic circuit, example:

Unit 2 Session - 6 Combinational Logic Circuits

UNIT 4 MINTERM AND MAXTERM EXPANSIONS

Karnaugh Map & Boolean Expression Simplification

ELC224C. Karnaugh Maps

ENG2410 Digital Design Combinational Logic Circuits

Gate-Level Minimization

Lecture 4: Four Input K-Maps

DIGITAL ELECTRONICS & it0203 Semester 3

Boolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE

UNIT 3 BOOLEAN ALGEBRA (CONT D)

Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University

Digital Logic Design. Combinational Logic

Chapter 2 Combinational Logic Circuits

Unit 6. Quine-McClusky Method. Unit 6 1

Chap 2. Combinational Logic Circuits

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

Chapter 3. Boolean Algebra. (continued)

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012

T9: Covering. Prove true by: Method 1: Perfect induction Method 2: Using other theorems and axioms. Number Theorem. T9 B (B+C) = B Covering

1. Expand each of the following functions into a canonical sum-of-products expression.

L4: Karnaugh diagrams, two-, and multi-level minimization. Elena Dubrova KTH / ICT / ES

Karnaugh Maps ف ر آ ا د : ا ا ب ا م آ ه ا ن ر ا

Number System conversions

Principles of Computer Architecture. Appendix B: Reduction of Digital Logic. Chapter Contents

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits

Minimization techniques

Logic Simplification. Boolean Simplification Example. Applying Boolean Identities F = A B C + A B C + A BC + ABC. Karnaugh Maps 2/10/2009 COMP370 1

Introduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps

MC9211 Computer Organization

Administrative Notes. Chapter 2 <9>

Karnaugh Maps (K-Maps)

Review for Test 1 : Ch1 5

Digital Circuit And Logic Design I. Lecture 4

Week-I. Combinational Logic & Circuits

for Digital Systems Simplification of logic functions Tajana Simunic Rosing Sources: TSR, Katz, Boriello & Vahid

CPE100: Digital Logic Design I

E&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev

Computer Organization I. Lecture 13: Design of Combinational Logic Circuits

Combinational Logic Fundamentals

Chapter 2. Digital Logic Basics

Logical Design of Digital Systems

E&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev. Section 2: Boolean Algebra & Logic Gates

Review. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms

211: Computer Architecture Summer 2016

Total Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18

Combinational Logic. Review of Combinational Logic 1

Unit 2 Boolean Algebra

CHAPTER 7. Exercises 17/ / /2 2 0

Ch 2. Combinational Logic. II - Combinational Logic Contemporary Logic Design 1

EEE130 Digital Electronics I Lecture #4

Simplifying Logic Circuits with Karnaugh Maps

Reduction of Logic Equations using Karnaugh Maps

Chapter-2 BOOLEAN ALGEBRA

CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES

CPE100: Digital Logic Design I

Introduction to Karnaugh Maps

3. PRINCIPLES OF COMBINATIONAL LOGIC

Computer Science Final Examination Friday December 14 th 2001

Computer Organization I

Chapter 7 Logic Circuits

APPLİCATION OF BOOLEAN ALGEABRA

Quine-McCluskey (Tabular) Minimization

Unit 2 Boolean Algebra

Digital Logic Circuits - Switching Algebra - Combinational Circuits -

ELCT201: DIGITAL LOGIC DESIGN

Combinatorial Logic Design Principles

Chapter 2 Boolean Algebra and Logic Gates

Fundamentals of Boolean Algebra

Solutions to Assignment No 5 Digital Techniques Fall 2007

CSE 140 Midterm I - Solution

Chapter 2 Combinational Logic Circuits

K-map Definitions. abc

Chapter 2 Combinational Logic Circuits

2 Application of Boolean Algebra Theorems (15 Points - graded for completion only)

14:332:231 DIGITAL LOGIC DESIGN. Combinational Circuit Synthesis

The Karnaugh Map COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals

Chapter 4 Optimized Implementation of Logic Functions

ELEC Digital Logic Circuits Fall 2014 Logic Minimization (Chapter 3)

PI = { a.b.c, ac d, b cd, ab d, bd} cd

ECE 238L Boolean Algebra - Part I

Working with Combinational Logic. Design example: 2x2-bit multiplier

Lecture 5. Karnaugh-Map

Hardware Design I Chap. 2 Basis of logical circuit, logical expression, and logical function

Transcription:

CHAPTER 5 1/36 KARNAUGH MAPS This chapter in the book includes: Objectives Study Guide 5.1 Minimum Forms of Switching Functions 5.2 Two- and Three-Variable Karnaugh Maps 5.3 Four-Variable Karnaugh Maps 5.4 Determination of Minimum Expressions 5.5 Five-Variable Karnaugh Maps 5.6 Other Uses of Karnaugh Maps 5.7 Other Forms of Karnaugh Maps Programmed Exercises Problems

Objectives 2/36 Topics introduced in this chapter: 1. Given a function (completely or in completely specified) of three to five variable, plot it on a Karnaugh map. The function may be given in minterm, maxterm, or algebraic form. 2. Determine the essential prime implicants of a function from a map. 3. Obtain the minimum sum-of-products or minimum product-of-sums form of a function from the map. 4. Determine all of the prime implicants of a function from a map. 5. Understand the relation between operations performed using the map and the corresponding algebraic operation.

5.1 Minimum Forms of Switching Functions 3/36 1. Combine terms by using XY XY X Do this repeatedly to eliminates as many literals as possible. A given term may be used more than once because X X X 2. Eliminate redundant terms by using the consensus theorems.

4/36 Fundamentals of Logic Design Chap. 5 5.1 Minimum Forms of Switching Functions ab bc c b b a abc abc c ab bc a c b a c b a F m c b a F (0,1,2,5,6,7) ),, ( ac bc b a abc abc c ab bc a c b a c b a F Example: Find a minimum sum-of-products

5/36 Fundamentals of Logic Design Chap. 5 5.1 Minimum Forms of Switching Functions ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( D C D B A D C C B A D B A D C B D C B C B A D B A D C B A D C B A D C B A D C B A D C B A D C B A Eliminate by consensus Example: Find a minimum product-of-sums

5.2 Two- and Three-Variable Karnaugh Maps 6/36 A 2-variable Karnaugh Map

5.2 Two- and Three-Variable Karnaugh Maps 7/36 Truth Table for a function F (a)

5.2 Two- and Three-Variable Karnaugh Maps 8/36 Truth Table and Karnaugh Map for Three-Variable Function

5.2 Two- and Three-Variable Karnaugh Maps 9/36 Location of Minterms on a Three-Variable Karnaugh Map

10/36 Fundamentals of Logic Design Chap. 5 5.2 Two- and Three-Variable Karnaugh Maps 7 6 4 2 0 5 3 1 ),, ( M M M M M m m m c b a F Karnaugh Map of F(a, b, c) = m(1, 3, 5) = M(0, 2, 4, 6, 7)

5.2 Two- and Three-Variable Karnaugh Maps 11/36 Karnaugh Maps for Product Terms

5.2 Two- and Three-Variable Karnaugh Maps 12/36 Given Function f ( a, b, c) abc b c a

5.2 Two- and Three-Variable Karnaugh Maps 13/36 Simplification of a Three-Variable Function F T1 T2 a c b c

5.2 Two- and Three-Variable Karnaugh Maps 14/36 Complement of Map in Figure 5-6(a) F T 1 T 2 c ab

5.2 Two- and Three-Variable Karnaugh Maps 15/36 Karnaugh Maps Which Illustrate the Consensus Theorem Consensus term is redundant

5.2 Two- and Three-Variable Karnaugh Maps 16/36 Function with Two Minimal Forms F m(0,1,2,5,6,7 )

5.3 Four-Variable Karnaugh Maps 17/36 Location of Minterms on Four-Variable Karnaugh Map

5.3 Four-Variable Karnaugh Maps 18/36 Plot of acd + a b + d f ( a, b, c, d) acd a b d

5.3 Four-Variable Karnaugh Maps 19/36 Simplification of Four-Variable Functions

5.3 Four-Variable Karnaugh Maps 20/36 Simplification of an Incompletely Specified Function Don t care term

5.3 Four-Variable Karnaugh Maps 21/36 Figure 5-14 1s of f f x z wyz w y z x y 0s of f f y z wxz w xy f ( y z)( w x z)( w x y) minimum product of sum for f

5.4 Determination of Minimum Expressions Using Essential Prime Implicants 22/36 - Implicants of F : Any single 1 or any group of 1 s which can be combined together on a Map ( 관련항 ) - prime Implicants of F : A product term if it can not be combined with other terms to eliminate variable ( 주항 ) It is not Prime implicants since it can be combined with other terms Prime implicants It is not Prime implicants since it can be combined with other terms Prime implicants Fundamentals of Logic Design Chap. 5

5.4 Determination of Minimum Expressions Using Essential Prime Implicants 23/36 Determination of All Prime Implicants

5.4 Determination of Minimum Expressions Using Essential Prime Implicants 24/36 Because all of the prime implicants of a function are generally not needed in forming the minimum sum of products, selecting prime implicants is needed. - CD is not needed to cover for minimum expression -B C, AC, BD are essential prime implicants - CD is not an essential prime implicants Fundamentals of Logic Design Chap. 5

5.4 Determination of Minimum Expressions Using Essential Prime Implicants 25/36 1. First, find essential prime implicants ( 필수주항 ) 2. If minterms are not covered by essential prime implicants only, more prime implicants must be added to form minimum expression. Note: 1 s shaded in blue are covered by only one prime implicant. All other 1 s are covered by at least two prime implicants. A BD A C A B D ACD or BCD

5.4 Determination of Minimum Expressions Using Essential Prime Implicants 26/36 Flowchart for Determining a Minimum Sum of Products Using a Karnaugh Map

5.4 Determination of Minimum Expressions Using Essential Prime Implicants 27/36 1. A B covers 1 6 and its adjacent essential PI 2. AB D covers 1 10 and its adjacent essential PI 3. AC D is chosen for minimal cover AC D is not an essential PI

5.5 Five-variable Karnaugh Maps 28/36 5 변수카노맵 4 변수카노맵위에하나를더위치시켜 3 차원으로만들수있다. 하층은 m 0 에서 m 15 까지, 상층은 m 16 에서 m 31 까지 4 변수카노맵각각의사각형을대각선으로나눠 2 차원으로만들수도있다. A A 00 DE 01 11 10 BC 00 01 11 10 A 1/0 BC DE 00 01 11 10 00 01 11 10 16 17 0 1 19 23 18 2 20 21 4 29 3 7 22 30 5 13 31 27 6 28 12 25 14 24 8 9 15 11 26 10

5.5 Five-Variable Karnaugh Maps 29/36 Five-Variable Karnaugh Map

5.5 Five-Variable Karnaugh Maps 30/36 Figure 5-22

5.5 Five-Variable Karnaugh Maps 31/36 Figure 5-23 F( A, B, C, D, E) m(0,1,4,5,13,15,20,21,22,23,24,26,28,30,31) F Resulting minimum solution A B D ABE ACD A BCE AB C or P1 P2 P3 P4 B CD

5.5 Five-Variable Karnaugh Maps 32/36 Figure 5-24 F( A, B, C, D, E) m(0,1,3,8,9,14,15,16,17,19,25,27,31) Final solution C D E F B C D B C E A C D A BCD ABDE or P 1 P 2 P 3 P 4 P 5 AC E Fundamentals of Logic Design Chap. 5

5.6 Other Uses of Karnaugh Maps 33/36 Fig 5-14. Show Equivalence of two functions using karnaugh map minturm expansion of f is f maxterm expansion of f is f m(0,2,3,4,8,10,11,15) same M (1,5,6,7,9,12,16,14) Figure 5-25 Factoring expression

5.6 Other Uses of Karnaugh Maps 34/36 Minimize solution Figure 5-26 F ABCD B CDE A B BCE Using the consensus theorem: F ABCD B CDE A B BCE ACDE minimum solution : F A B BCE ACDE ACDE

5.7 Other Forms of Karnaugh Maps 35/36 Figure 5-27. Veitch Diagrams

5.7 Other Forms of Karnaugh Maps 36/36 Figure 5-28. Other Forms of Five-Variable Karnaugh Maps

5.7 Other Forms of Karnaugh Maps 37/36 Figure 5-28. Other Forms of Five-Variable Karnaugh Maps