Lecture 5. Karnaugh-Map

Similar documents
UNIT 5 KARNAUGH MAPS Spring 2011

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

Lecture 7: Karnaugh Map, Don t Cares

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

Unit 2 Session - 6 Combinational Logic Circuits

This form sometimes used in logic circuit, example:

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

Minimization techniques

Chapter 2 Combinational Logic Circuits

ELC224C. Karnaugh Maps

Combinational Logic Circuits Part II -Theoretical Foundations

Gate-Level Minimization

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

Signals and Systems Digital Logic System

CMSC 313 Lecture 19 Combinational Logic Components Programmable Logic Arrays Karnaugh Maps

Karnaugh Maps Objectives

Karnaugh Map & Boolean Expression Simplification

Lecture 4: More Boolean Algebra

ELCT201: DIGITAL LOGIC DESIGN

Boolean Algebra and Logic Simplification

CMSC 313 Lecture 19 Homework 4 Questions Combinational Logic Components Programmable Logic Arrays Introduction to Circuit Simplification

Textbook: Digital Design, 3 rd. Edition M. Morris Mano

MC9211 Computer Organization

Chapter 2 Combinational Logic Circuits

Simplifying Logic Circuits with Karnaugh Maps

CHAPTER 5 KARNAUGH MAPS

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

Digital Logic Design. Combinational Logic

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

ENG2410 Digital Design Combinational Logic Circuits

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

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

EE 110 Practice Problems for Exam 1: Solutions, Fall 2008

Logic Design I (17.341) Fall Lecture Outline

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

CHAPTER III BOOLEAN ALGEBRA

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

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

Karnaugh Maps (K-Maps)

Chapter 7 Logic Circuits

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

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

CS/EE 181a 2010/11 Lecture 4

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

Administrative Notes. Chapter 2 <9>

Logic Design. Chapter 2: Introduction to Logic Circuits

CHAPTER III BOOLEAN ALGEBRA

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

CPE100: Digital Logic Design I

Combinational Digital Design. Laboratory Manual. Experiment #6. Simplification using Karnaugh Map

Chapter-2 BOOLEAN ALGEBRA

EEE130 Digital Electronics I Lecture #4

211: Computer Architecture Summer 2016

Chap 2. Combinational Logic Circuits

Standard Expression Forms

3. PRINCIPLES OF COMBINATIONAL LOGIC

CHAPTER 7. Solutions for Exercises

DIGITAL ELECTRONICS & it0203 Semester 3

Boolean Algebra, Gates and Circuits

Mark Redekopp, All rights reserved. Lecture 5 Slides. Canonical Sums and Products (Minterms and Maxterms) 2-3 Variable Theorems DeMorgan s Theorem

14:332:231 DIGITAL LOGIC DESIGN

CHAPTER 7. Exercises 17/ / /2 2 0

CS/EE 181a 2008/09 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

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

Digital Logic Design. Malik Najmus Siraj

Chapter 2: Princess Sumaya Univ. Computer Engineering Dept.

ECE 238L Boolean Algebra - Part I

Chapter 5. Karnaugh Map and Minimization Procedures

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

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

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

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

CHAPTER1: Digital Logic Circuits Combination Circuits

7.1. Unit 7. Minterm and Canonical Sums 2- and 3-Variable Boolean Algebra Theorems DeMorgan's Theorem Simplification using Boolean Algebra

Chapter 4 Optimized Implementation of Logic Functions

Midterm1 Review. Jan 24 Armita

Review for Test 1 : Ch1 5

UNIT 3 BOOLEAN ALGEBRA (CONT D)

WEEK 3.1 MORE ON KARNAUGH MAPS

Lecture 2 Review on Digital Logic (Part 1)

Optimizations and Tradeoffs. Combinational Logic Optimization

Functions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways:

Digital Design 2. Logic Gates and Boolean Algebra

Spiral 1 / Unit 5. Karnaugh Maps

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

L2: Combinational Logic Design (Construction and Boolean Algebra)

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

CHAPTER 3 BOOLEAN ALGEBRA

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

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

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table

Unit 2 Boolean Algebra

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

Contents. Chapter 3 Combinational Circuits Page 1 of 36

L2: Combinational Logic Design (Construction and Boolean Algebra)

Chapter 2 : Boolean Algebra and Logic Gates

Combinatorial Logic Design Principles

Combinational Logic Design/Circuits

CSE 140: Components and Design Techniques for Digital Systems

Transcription:

Lecture 5 - Lecture 5 Karnaugh-Map

Lecture 5-2 Karnaugh-Map Set Logic Venn Diagram K-map

Lecture 5-3 K-Map for 2 Variables

Lecture 5-4 K-Map for 3 Variables C C C

Lecture 5-5 Logic Expression, Truth Table, K-Map, and Logic Diagram F = + Logic Expression F Truth Table K-Map Logic Diagram (= Digital Circuit Represenation) F

Lecture 5-6 Non-Unique Circuits for the Same Function F = + ecause F = + = ( + )+ = + + F F

Lecture 5-7 Key Terms Literal - a variable or the complement of a variable. ex) X, Y, X Product Term (=Cube) : a single literal or a product of two or more literals. ex) Z,, WYZ, W Y Z. product term can be represented by a rectangle in a K-map and we will see why later. Sum-of-product (=SOP) : a sum of product terms. ex) W+Y, +Z+ Sum Term. Product-of-Sums (POS). Normal Term - a product or sum term in which no var. appears more than once. ex) Z, Y+W n-variable minterm - a normal product term with n literals. ex) W, W (3-variable minterm)

Lecture 5-8 True Table gain Let s derive the logical expression from a truth table. X Y Z F F = X Y Z + X Y Z (= XZ) truth table provides a Sum-of-Product (SOP) form naturally. : each product is a minterm in this case. K-map also provides a Sum-of-Product (SOP) form naturally. : each product does not have to be a minterm as we will see.

Lecture 5-9 K-Map Indexing Methods X Z Y Z Our Choice

Lecture 5 - Property of K-Map One cell in K-map represents a minterm. We can get an ND-OR (Sum-of-Product) style circuits easily from K-map. Two adjecent cells in K-map contain the same variable in positive and negative forms. Z X Y Z X Y Z

Lecture 5 - djacency in K-Map () cell is adjacent to the cells if they share a line.. Z WX YZ

Lecture 5-2 djacency in K-Map (2) Note that the cell on the boundary are adjacent to the cell on the other side. (You need some imagination power!!) Z WX YZ

Lecture 5-3 Motivation of K-Map Simplification If we express K-map using logic expression, only the cells with show up in Sum-of-Product form. Z X Y Z F = X Y Z + X Y Z X Y Z Two product terms that differ only in a variable can be combined into one. Ex) X Y Z + X Y Z = XZ(Y+Y) = XZ We like simpler form. How can we get simler expression from K-map?

Lecture 5-4 Introduction to K-Map Simplification We use a ractangle to specify that the product term in that ractangle can be combined to one product. Z X Z How to read the expression for a ractangle? - Find out the variable whose polarity (positive or negative) is consistent in the ractangle.

Lecture 5-5 Excercise on a Ractangle Reading Z WX YZ

Lecture 5-6 Minterm Numbers in Truth Table and K-Map X Y Z minterm no. 2 3 4 5 6 7 Z 2 6 4 3 7 5 F =X Y Z + X Y Z can be described by F = (, 7)

Lecture 5-7 K-Map Simplification Examples F = (,,2,3) C F C F = C + C + C + C = C + C C F = C + C =

Lecture 5-8 Z Z

Lecture 5-9 Z F = X Z + X Y Z Z F = X Z + Y Z (etter) Lesson - Combine cells using as large ractangle as possible.

Lecture 5-2 Z Impossible cover (Only cells in a rectangle can be circled. Why?) Z Redundant cover Lesson - Use as few ractangless possible.

Lecture 5-2 djacent Covers CD D D The two covers differ in only one variables if the two covers are adjecent. Then the two covers can be combined into one cover.

Lecture 5-22 Partially Overlapped Covers CD D D The two covers differ in more than one variables. The two covers are partially overlapped. Then the two covers cannot be combined.

Lecture 5-23 djacent Covers with Different Sizes CD D D The two covers have different size. The two covers differ in more than one variables. Then the two covers cannot be combined.

Lecture 5-24 djacency in K-Map (3) cube is adjacent to another cube if they share a segment along one side and their sizes are the same. Z WX YZ

Lecture 5-25 The Covers That Can e Combined They must be adjecent. Correct covers can have 2 n cells in it. 2 + 2 = 4, 4 + 4 = 8, 8 + 8 = 6, so on...

Lecture 5-26 Practice Z Z CD CD