Karnaugh Maps Objectives

Similar documents
UNIT 5 KARNAUGH MAPS Spring 2011

CHAPTER 5 KARNAUGH MAPS

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

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

Unit 2 Session - 6 Combinational Logic Circuits

Karnaugh Map & Boolean Expression Simplification

ELC224C. Karnaugh Maps

Chapter 2 Combinational Logic Circuits

This form sometimes used in logic circuit, example:

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

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

ENG2410 Digital Design Combinational Logic Circuits

CHAPTER III BOOLEAN ALGEBRA

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

Optimizations and Tradeoffs. Combinational Logic Optimization

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

Gate-Level Minimization

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

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

CSE 140: Components and Design Techniques for Digital Systems

Logic Design I (17.341) Fall Lecture Outline

DIGITAL ELECTRONICS & it0203 Semester 3

Midterm1 Review. Jan 24 Armita

211: Computer Architecture Summer 2016

Introduction to Karnaugh Maps

Digital Logic Design. Combinational Logic

Minimization techniques

Chapter 2 Combinational Logic Circuits

Number System conversions

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

Chap 2. Combinational Logic Circuits

Lecture 4: Four Input K-Maps

Simplifying Logic Circuits with Karnaugh Maps

CHAPTER 3 BOOLEAN ALGEBRA

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

MC9211 Computer Organization

Review for Test 1 : Ch1 5

Week-I. Combinational Logic & Circuits

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

Karnaugh Maps (K-Maps)

UNIT 4 MINTERM AND MAXTERM EXPANSIONS

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

Digital Circuit And Logic Design I. Lecture 4

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

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

Combinational Logic Fundamentals

ELCT201: DIGITAL LOGIC DESIGN

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

II. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):

ECE 238L Boolean Algebra - Part I

Chapter-2 BOOLEAN ALGEBRA

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

Signals and Systems Digital Logic System

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

UNIT 3 BOOLEAN ALGEBRA (CONT D)

CS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman

Chapter 2. Digital Logic Basics

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

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

Chapter 4 Optimized Implementation of Logic Functions

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

Computer Science Final Examination Friday December 14 th 2001

CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES

CPE100: Digital Logic Design I

Systems I: Computer Organization and Architecture

Reduction of Logic Equations using Karnaugh Maps

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

Binary logic consists of binary variables and logical operations. The variables are

Chapter 7 Logic Circuits

Chapter 3. Boolean Algebra. (continued)

Chapter 2: Princess Sumaya Univ. Computer Engineering Dept.

Quine-McCluskey (Tabular) Minimization

Combinatorial Logic Design Principles

Logical Design of Digital Systems

Spiral 1 / Unit 5. Karnaugh Maps

Part 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...

Chapter 2. Boolean Algebra and Logic Gates

Chapter 2 Boolean Algebra and Logic Gates

Unit 2 Boolean Algebra

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

Administrative Notes. Chapter 2 <9>

Unit 6. Quine-McClusky Method. Unit 6 1

Outcomes. Spiral 1 / Unit 5. Logic Function Synthesis KARNAUGH MAPS. Karnaugh Maps

14:332:231 DIGITAL LOGIC DESIGN

CHAPTER 12 Boolean Algebra

MODULAR CIRCUITS CHAPTER 7

Chapter 2 Combinational Logic Circuits

Boolean Algebra, Gates and Circuits

EEE130 Digital Electronics I Lecture #4

Standard Expression Forms

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

Computer Organization I

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

CSE 140 Midterm I - Solution

Combinational Logic. Review of Combinational Logic 1

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

CHAPTER1: Digital Logic Circuits Combination Circuits

Contents. Chapter 3 Combinational Circuits Page 1 of 36

Transcription:

Karnaugh Maps Objectives For Karnaugh Maps of up to 5 variables Plot a function from algebraic, minterm or maxterm form Obtain minimum Sum of Products and Product of Sums Understand the relationship between the map and algebraic operations Handle don t cares using Karnaugh maps Determine the Prime Implicants

What are Karnaugh Maps? A simpler way to handle most (but not all) jobs of manipulating logic functions. The map is a diagram made up of squares, each small square represents a minterm. Any function is made up of minterms and can be represented on the map. Adjacent minterms can be combined to form simpler terms. Karnaugh Map Advantages Can be done more systematically Much simpler to find minimum solutions Easier to see what is happening

2 Variable Karnaugh Map B B A A A=, B= A B A=, B= A=, B= A=, B= A B F = A B + AB F = B A B F B B A B = A = or A

3 Variable Karnaugh Map Note the order of the B C variables: BC A A B C = A B C =

3 Variable Karnaugh Map A B C F BC A BC A =, B =, C = don t care A A =, C =, B = don t care F = AC + A B

Minterm Expression to Karnaugh Map BC A 3 2 4 5 7 6 Each minterm corresponds to a location on the Karnaugh Map m m 7

Minterm Expression to Karnaugh Map F (A,B,C) = m (, 4, 5, 6 ) BC A Remaining maps spaces are.

Maxterm Expression to Karnaugh Map Each maxterm in the expression corresponds to a on the Karnaugh Map M M 7 BC A 3 2 4 5 7 6

Maxterm Expression to Karnaugh Map F (A,B,C) = M(2, 3, 4 ) BC A 3 2 4 5 7 6 Remaining maps spaces are

Adjacent Spaces BC A A'B'C Adjacent spaces on the map differ by complementing exactly one variable. AB'C' AB'C ABC BC A Note that the map wraps around so edge spaces are also adjacent. AB'C' ABC'

Combining Terms Adjacent spaces can be combined using: XY + XY = X BC A A'B'C AB'C' AB'C ABC' A B C + AB C = B C AB C + ABC = AC

Combining Terms Adjacent spaces can be combined using: XY + XY = X BC A A'B'C' A'B'C AB'C' AB'C A B C + AB C + A B C + AB C B C (A + A ) + B C (A + A ) B (C + C ) B

Boolean Algebra to Karnaugh Map bc a Plot: ab c + bc + a

Mapping Sum of Product Terms The 3 variable map has 8 possible terms with 3 literals The 3 variable map has 2 possible terms with 2 literals The 3 variable map has 6 possible terms with literal X X X X X Y Z Y Z Y Z Y Z Y Z X X Y Z Y Z XY Z etc. X X Z

4 Variable Karnaugh Map YZ WX W X Y Z = WXY Z The map of four variables is shown beside. It consists of sixteen small squares, arranged as a 4 x 4 small squares. Each small square represents one minterm. Each minterm has four neighboring (or adjacent) minterms. The map minimization of four variable functions depends on combining adjacent squares. The combination of adjacent squares help in the simplification of the functions. One square represents minterm (4 literals). Two adjacent squares represent a term with three literals. Four adjacent squares represent a term of two literals. Eight adjacent squares represent a term of one literal. Sixteen adjacent squares represent the function (F = )

Boolean Algebra to Karnaugh Map Plot: A B + BD + AB C D + B CD CD AB

Karnaugh Map to Boolean Algebra (Simplification) Plot: A B + BD + AB C D + B CD Generate: A B + CD + AD CD AB

Complement Functions The Complement of a Karnaugh Map is formed by inverting every location. NP LM F F NP LM

Finding a Function Through Product of Sums Sometimes it is easier to plot the Product of Sums: F = MN P + LM NP NP LM F = (M + N + P) (L + M + N + P )

Karnaugh Map with Don t Care Values When we design combinational logic circuits, we sometimes encounter situations where combinations of the input variables will never occur. In such cases, we can assume that these conditions can take on the value or, whichever going to give us a simpler expression. These conditions are indicated by letter X or D. Simplify: F (A,B,C,D) = m (, 5, 6,,, 4 ) + d (, 7, 9, 5 ) = AC + BC + A C D CD AB X 3 2 X 4 5 7 6 2 3 5 4 X X 8 9

Minimum Sum of Products A minimum sum of products is a sum of products expression which has a minimum number of terms has a minimum number of literals for all expressions with a minimum number of terms Minimum CD AB CD AB F = CD + AD + BC F = CD + AD + A BCD

Minimum Product of Sums A minimum product of sums is a product of sums expression which has a minimum number of products has a minimum number of literals for all expressions with a minimum number of products F = (A + B) (B + C) (A + D) F = (A + B) (B + C) (A + D) (B + D)

Prime Implicants A group of s which are adjacent and can be combined on a Karnaugh Map is called an implicant. If it can not be combined with another term to eliminate a variable, it is called a prime implicant. A minimum sum of products will contain only prime implicants. Not all prime implicants are needed in a minimum sum of products CD AB A B CD AC D ABC D Prime Implicants AB D AB Prime Implicants AB C B CD Prime Implicants

Prime Implicants This function has exactly 4 prime implicants CD AB Only 3 are needed in the minimum sum of products BC C D F = BC + ABD + B D ABD B D

Essential Prime Implicants An essential prime implicant is one which covers a minterm NOT covered by any other prime implicant. All essential prime implicants are part of the minimum sum of products. BC is an essential prime implicant since it is the only one which covers A BC D C D is not an essential prime implicant since the minterms it covers are covered by other prime implicants BC C D CD AB ABD B D

Finding the Minimum Sum of Products. Find each essential prime implicant and include it in the solution. 2. Determine if any minterms are not yet covered. 3. Pick a prime implicant which covers it. 4. Continue until all minterm are covered. 5. Return to step 3 and check other combinations of (non-essential) prime implicants to find the minimum set.

Find the Minimum Sum of Products. Find all the prime implicants CD AB 3. Select a set of non-essential prime implicants which covers all minterms F = BC + B C + AB OR F = BC + B C + AC 2. Find all the essential prime implicants F = BC + B C +... CD AB CD AB

5 Variable Karnaugh Map D E D E B C B C 3 2 6 7 9 8 4 5 7 6 2 2 23 22 2 3 5 4 28 29 3 3 8 9 24 25 27 26 A = A = AB CDE A BC D E Choice of variable A allows easier ordering of minterms

5 Variable Karnaugh Map C D C D A B A B 2 6 4 3 7 5 8 E = E = Choice of variable E is harder; other choices are worse

5 Variable Karnaugh Map Find the minimum sum-of-products for: H(A,B,C,D,E) = m (,2,3,7,8-,3,4,6,23,24,27,28) + B C D E D E B C X X X A = A =. Find prime implicants of size 6 2. Find prime implicants of size 8 3. Find prime implicants of size 4 4. Find prime implicants of size 2 d (, 6, 22) A C A DE A B D C D E A BD E ABD E AB CE B CDE BC DE

Summary For Karnaugh Maps of up to 5 variables Plot a function from algebraic, minterm or maxterm form Determine the Prime Implicants Obtain minimum Sum of Products and Product of Sums Understand the relationship between the map and algebraic operations Handle don t cares using Karnaugh maps