Chapter 5. Karnaugh Map and Minimization Procedures

Similar documents
This form sometimes used in logic circuit, example:

Combinational Logic Circuits Part II -Theoretical Foundations

Chapter 4 BOOLEAN ALGEBRA AND THEOREMS, MINI TERMS AND MAX TERMS

Karnaugh Map & Boolean Expression Simplification

Boolean Algebra and Logic Simplification

Minimization techniques

Ex: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.

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

Chapter 7 Logic Circuits

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

Digital Fundamentals

CHAPTER 7. Solutions for Exercises

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

CPE100: Digital Logic Design I

Unit 2 Session - 6 Combinational Logic Circuits

211: Computer Architecture Summer 2016

Simplifying Logic Circuits with Karnaugh Maps

MC9211 Computer Organization

Chapter 15 SEQUENTIAL CIRCUITS ANALYSIS, STATE- MINIMIZATION, ASSIGNMENT AND CIRCUIT IMPLEMENTATION

Chapter 14 Sequential logic, Latches and Flip-Flops

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

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

UNIT 5 KARNAUGH MAPS Spring 2011

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

Chapter 2 : Boolean Algebra and Logic Gates

UNIT 4 MINTERM AND MAXTERM EXPANSIONS

ENGG 1203 Tutorial - 2 Recall Lab 2 - e.g. 4 input XOR. Parity checking (for interest) Recall : Simplification methods. Recall : Time Delay

Digital Logic Design. Combinational Logic

Lecture 5. Karnaugh-Map

CHAPTER III BOOLEAN ALGEBRA

ELCT201: DIGITAL LOGIC DESIGN

CSE 140: Components and Design Techniques for Digital Systems

Why digital? Overview. Number Systems. Binary to Decimal conversion

Optimizations and Tradeoffs. Combinational Logic Optimization

Midterm1 Review. Jan 24 Armita

CHAPTER III BOOLEAN ALGEBRA

Chapter 2 Combinational Logic Circuits

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

Standard Expression Forms

Digital Circuit And Logic Design I. Lecture 3

Chapter 2 Combinational Logic Circuits

Signals and Systems Digital Logic System

Slides for Lecture 10

CprE 281: Digital Logic

1. Name the person who developed Boolean algebra

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

Chapter 2 Combinational Logic Circuits

Karnaugh Maps Objectives

Theorem/Law/Axioms Over (.) Over (+)

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

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

Administrative Notes. Chapter 2 <9>

Computer Organization I

CS 226: Digital Logic Design

Digital Design 2. Logic Gates and Boolean Algebra

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

Digital Circuit And Logic Design I. Lecture 4

Combinational Logic Fundamentals

Lecture 7: Karnaugh Map, Don t Cares

Learning Objectives 10/7/2010. CE 411 Digital System Design. Fundamental of Logic Design. Review the basic concepts of logic circuits. Dr.

Gate-Level Minimization

Chapter 4 Optimized Implementation of Logic Functions

Chapter 2: Princess Sumaya Univ. Computer Engineering Dept.

ELC224C. Karnaugh Maps

Digital Logic Design. Malik Najmus Siraj

Boolean Algebra, Gates and Circuits


CHAPTER 5 KARNAUGH MAPS

Lecture 4: Four Input K-Maps

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

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

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

L2: Combinational Logic Design (Construction and Boolean Algebra)

Prove that if not fat and not triangle necessarily means not green then green must be fat or triangle (or both).

DIGITAL ELECTRONICS & it0203 Semester 3

Reduction of Logic Equations using Karnaugh Maps

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

Boolean Algebra. Boolean Variables, Functions. NOT operation. AND operation. AND operation (cont). OR operation

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

Combinational Logic Design/Circuits

K-map Definitions. abc

Number System conversions

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

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

ELEC Digital Logic Circuits Fall 2014 Switching Algebra (Chapter 2)

ENGR 303 Introduction to Logic Design Lecture 3. Dr. Chuck Brown Engineering and Computer Information Science Folsom Lake College

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

Lecture 4: More Boolean Algebra

Logic Design. Chapter 2: Introduction to Logic Circuits

ENG2410 Digital Design Combinational Logic Circuits

Spiral 1 / Unit 3

Boolean Algebra & Logic Gates. By : Ali Mustafa

CHAPTER1: Digital Logic Circuits Combination Circuits

Chapter 2 Boolean Algebra and Logic Gates

EEE130 Digital Electronics I Lecture #4

Chapter 2: Switching Algebra and Logic Circuits

Digital Logic & Computer Design CS Professor Dan Moldovan Spring Copyright 2007 Elsevier 2-<101>

If f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C

Digital Logic & Computer Design CS Professor Dan Moldovan Spring 2010

Logic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 2 Circuit Optimization

Transcription:

hapter 5 Karnaugh Map and Minimization Procedures

Lesson 1 KARNAUGH MAP h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 2

Outline Three variable Karnaugh map Four variable Karnaugh map Five/Six Variable Karnaugh Map h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 3

Map from 3 variables Truth table or SOP form Boolean Expression A two-dimensional map built from a truth table or 3 variables SOP form Boolean Expression Since number of rows in three variable (three inputs) truth table are 8, the map has 8 cells Two cells horizontal and four cells vertical. [It can also be vice versa.] h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 4

Map for F = A.B. + A.B. AB AB 00 0 1 AB 01 1 AB 11 AB 10 1 Σ m(3, 4) h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 5

Map for F = A.B. + A.B. +A.B. + A.B. + A.B. AB 0 1 AB 00 1 AB 01 1 AB 11 1 Σ m(0, 3, 4, 5, 7 ) AB 10 1 1 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 6

Filling the cell with 1s 1 When output is 1 for a given combination of A, B and, we place 1 at the corresponding cell. 2 omplete the step 1 for all the rows of truth table with outputs = 1. h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 7

orresponding miniterms of the cells AB AB 00 0 m0 1 m1 AB 01 m2 m3 AB 11 m6 m7 AB 10 m4 m5 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 8

Map for F = (A+ B + ). (A+ B+ ) AB 0 1 A+B 00 0 A+B 01 A+B 11 0 A+B 10 Π M(1, 6) h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 9

Filling the cell with 0s from POS form 1 When output is 0 for a given combination of A, B and, we place 0 at the corresponding cell. 2 omplete the step 1 for all 8 rows of truth table with outputs = 0. h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 10

orresponding Maxterms of the cells AB A+B 00 0 M0 1 M1 A+B 01 M2 M3 A+B 11 M6 M7 A+B 10 M4 M5 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 11

Outline Three variable Karnaugh map Four variable Karnaugh map Five/Six Variable Karnaugh Map h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 12

Map from 4 variables Truth table or SOP form Boolean Expression A two-dimensional map built from a truth table or 4 variables SOP form Boolean Expression Since number of rows in a four variable (three inputs) truth table are 16, the map has 16 cells Four cells horizontal and four cells vertical. h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 13

Map for F = A.B..D + A.B..D + A.B..D Σ m(3, 6, 8) AB D D D D 00 01 11 10 AB 00 1 AB 01 1 AB 11 AB 10 1 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 14

Map for F = A.B..D + A.B..D + A.B..D Σ m(4, 8, 10) AB AB 00 AB 01 1 D D D D 00 01 11 10 AB 11 AB 10 1 1 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 15

Filling the cell with 1s 1. When output is 1 for a given combination of A, B, and D, we place 1 at the corresponding cell. 2. omplete the step 1 for all 16 rows of truth table with outputs = 1. h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 16

orresponding Miniterms of the cells D D D D AB 00 01 11 10 AB 00 m0 m1 m3 m2 AB 01 m4 m5 m7 m6 AB 11 m12 m13 AB 10 m8 m9 m15 m11 m14 m10 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 17

Filling the cell with 0s from POS form 1 When output is 0 for a given combination of A, B and, we place 0 at the corresponding cell. 2 omplete the step 1 for all the rows of truth table with outputs = 0. h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 18

Map for F = (A+B++D). (A+B++D) AB +D 00 A+B 00 0 A+B 01 A+B 11 +D 01 Π M(0, 10) +D 11 +D 10 A+B 10 0 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 19

orresponding Maxterms of the cells +D +D +D +D AB 00 01 11 10 A+B 00 M0 M1 M3 M2 A+B 01 M4 M5 M7 M6 A+B 11 M12 M13 M15 M14 A+B 10 M8 M9 M11 M10 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 20

Outline Three variable Karnaugh map Four variable Karnaugh map Five/Six Variable Karnaugh Map h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 21

Five Variable Map - Left part A = 0 DE DE DE DE B 00 01 11 10 B 00 m0 m1 m3 m2 B 01 m4 m5 m7 m6 B 11 m12 m13 B 10 m8 m9 m15 m11 m14 m10 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 22

Five Variable Map - Left part A = 1 DE DE DE DE B 00 01 11 10 B 00 m16 m17 m19 m18 B 01 m20 m21 m23 m22 B 11 m28 m29 B 10 m24 m25 m31 m27 m30 m26 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 23

Six Variable Map - Left Top part A, B = 0, 0 D EF EF EF EF 00 01 11 10 D 00 m0 m1 m3 m2 D 01 m4 m5 m7 m6 D 11 m12 m13 D 10 m8 m9 m15 m11 m14 m10 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 24

Six Variable Map - Right Top part A, B = 0, 1 D EF EF EF EF 00 01 11 10 D 00 m16 m17 m19 m18 D 01 m20 m21 m23 m22 D 11 m28 m29 D 10 m24 m25 m31 m27 m30 m26 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 25

Six Variable Map - Left Bottom part A, B = 1, 1 D D 00 D 01 EF EF EF EF 00 01 11 10 D 11 m63 m62 D 10 m56 m57 m59 m58 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 26

Six Variable Map - Right Bottom part A, B = 1, 0 D EF EF EF EF 00 01 11 10 D 00 D 01 D 11 D 10 m32 m40 m34 m42 h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 27

Summary h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 28

Karnaugh Map has cells. On moving from one cell to nearby cell, a variable complements First column and last column adjacent First row and last row adjacent Each cell represent one miniterm or one Maxterm Map reflect the truth table Map reflects the Boolean expression for output in SOP or POS form h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 29

End of Lesson 1 THREE VARIABLE KARNAUGH MAP h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 30

THANK YOU h05l1-"digital Principles and Design", Raj Kamal, Pearson Education, 2006 31