1 CS 20 Lecture 14 Karnaugh Maps Professor CK Cheng CSE Dept. UC San Diego.

Slides:

Advertisements

Similar presentations

ECE 301 – Digital Electronics Karnaugh Maps (Lecture #7) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,

Advertisements

ECE 301 – Digital Electronics Minterm and Maxterm Expansions and Incompletely Specified Functions (Lecture #6) The slides included herein were taken from.

ECE 331 – Digital System Design

ENGIN112 L8: Minimization with Karnaugh Maps September 19, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 8 Minimization with Karnaugh.

CS 140 Lecture 5 Professor CK Cheng 10/10/02. Part I. Combinational Logic 1.Spec 2.Implementation K-map: Sum of products Product of sums.

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 6 Dr. Shi Dept. of Electrical and Computer Engineering.

CS 140 Lecture 2 Combinational Logic CK Cheng 4/04/02.

1 CS 140 Lecture 3 Combinational Logic Professor CK Cheng CSE Dept. UC San Diego.

CS 140 Lecture 3 Professor CK Cheng 10/3/02. 1.Specification 2.Implementation 3.K-maps Part I.

CS 140 Lecture 3 Professor CK Cheng Tuesday 4/09/02.

1 CK Cheng CSE Dept. UC San Diego CS 140, Lecture 2 Combinational Logic.

CSE-221 Digital Logic Design (DLD)

CS 140 Lecture 4 Professor CK Cheng Tuesday 5/08/02.

CK Cheng Tuesday 10/2/02 CS 140 Lecture 2. Part I. Combinational Logic I) Specification –a. Language –b. Truth Table –c. Boolean Algebra –d. Incompletely.

CS 140 Lecture 4 Combinational Logic: K-Map Professor CK Cheng CSE Dept. UC San Diego 1.

1 CSE20 Lecture 16 Boolean Algebra: Applications Professor CK Cheng CSE Dept. UC San Diego 1.

1 CS 140 Lecture 3 Combinational Logic Professor CK Cheng CSE Dept. UC San Diego.

CS 140 Lecture 6 Professor CK Cheng UC San Diego.

CS 140 Lecture 4 Professor CK Cheng 4/11/02. Part I. Combinational Logic Implementation K-Map Given F R D Obj: Minimize sum of products Proc: Draw K-Map.

ECE 331 – Digital System Design Karnaugh Maps and Determining a Minimal Cover (Lecture #7) The slides included herein were taken from the materials accompanying.

CS 151 Digital Systems Design Lecture 8 Minimization with Karnaugh Maps.

CS 140 Lecture 5 Professor CK Cheng CSE Dept. UC San Diego.

CS 140 Lecture 5 Professor CK Cheng CSE Dept. UC San Diego 1.

Overview Part 2 – Circuit Optimization 2-4 Two-Level Optimization

Lecture 3: Incompletely Specified Functions and K Maps CSE 140: Components and Design Techniques for Digital Systems Fall 2014 CK Cheng Dept. of Computer.

BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)

K-map Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.

1 Simplification of Boolean Functions:  An implementation of a Boolean Function requires the use of logic gates.  A smaller number of gates, with each.

1 Chapter 5 Karnaugh Maps Mei Yang ECG Logic Design 1.

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.

Chapter 2 Two- Level Combinational Logic. Chapter Overview Logic Functions and Switches Not, AND, OR, NAND, NOR, XOR, XNOR Gate Logic Laws and Theorems.

CHAPTER 3: PRINCIPLES OF COMBINATIONAL LOGIC

LOGIC GATES & BOOLEAN ALGEBRA

Simplification of switching functions Simplify – why? –Switching functions map to switching circuits –Simpler function  simpler circuit –Reduce hardware.

Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 3 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

CS151 Introduction to Digital Design Chapter Map Simplification.

Copied with Permission from prof. Mark PSU ECE

Karnaugh Maps (K-Maps)

CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC

BR 2/1/991 Truth Tables (again) Recall that a boolean equation can be represented by a Truth Table A B C F

Karnaugh Maps Not in textbook. Karnaugh Maps K-maps provide a simple approach to reducing Boolean expressions from a input-output table. The output from.

C.S.Choy39 TERMINOLOGY Minterm –product term containing all input variables of a function in either true or complementary form Maxterm – sum term containing.

 Seattle Pacific University EE Logic System DesignKMaps-1 Two-Level Simplification All Boolean expressions can be represented in two- level forms.

CSE 140: Components and Design Techniques for Digital Systems Lecture 3: Incompletely Specified Functions and K Maps CK Cheng Dept. of Computer Science.

Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.

Lecture 4: Four Input K-Maps CSE 140: Components and Design Techniques for Digital Systems CK Cheng Dept. of Computer Science and Engineering University.

K-map Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.

ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)

School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.

Lecture 5: K-Map minimization in larger input dimensions and K-map minimization using max terms CSE 140: Components and Design Techniques for Digital Systems.

1 EENG 2710 Chapter 3 Simplification of Switching Functions.

CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC:K-Map. K-Map (1)  Karnaugh Map provides a systematic method for simplifying Boolean expressions and may produce.

Lecture 3: Incompletely Specified Functions and K Maps

Prof. Hsien-Hsin Sean Lee

Dr. Clincy Professor of CS

Karnaugh Maps (K-Maps)

Lecture 3: Incompletely Specified Functions and K Maps

Dr. Clincy Professor of CS

ECE 331 – Digital System Design

ECE 331 – Digital System Design

CS Chapter 3 (3A and ) – Part 3 of 5

Overview Part 2 – Circuit Optimization

CSE 140 Lecture 3 Combinational Logic: Implementation

Professor CK Cheng CSE Dept. UC San Diego

CSE 140 Lecture 4 Combinational Logic: K-Map

Lecture 3: Incompletely Specified Functions and K Maps

ECE 331 – Digital System Design

Presentation transcript:

1 CS 20 Lecture 14 Karnaugh Maps Professor CK Cheng CSE Dept. UC San Diego

2 1.Introduction 2.The Maps 3.Boolean Optimization Karnaugh Maps

3 Definitions: Literal: x i or x i ’ Product Term:x 2 x 1 ’x 0 Sum Term:x 2 + x 1 ’ + x 0 Minterm of n variables: A product of n literals in which every variable appears exactly once. f(a,b,c,d): ab’cd’, a’bc’d’ Maxterm of n variables: A sum of n literals in which every variable appears exactly once. f(a,b,c,d): (a’+b+c+d), (a’+b’+c+d) Introduction

4 Input: Boolean expression of n binary variables Goal: Simplification of the expression. E.g. we want to minimize # terms and # literals. Applications: Logic: rule reduction Hardware Design: cost and performance optimization. Cost (wires, gates): # literals, product terms, sum terms Performance: speed, reliability

5 Introduction IDABf(A,B)minterm A’B 2101AB’ 3111AB An example of 2-variable function f(A,B)=A+B

6 Function can be represented by sum of minterms: f(A,B) = A’B+AB’+AB This is not minimal however! We want to minimize the number of literals and terms. We factor out common terms – A’B+AB’+AB= A’B+AB’+AB+AB =(A’+A)B+A(B’+B)=B+A Hence, we have f(A,B) = A+B

7 K-Map: Truth Table in 2 Dimensions A = 0 A = 1 B = 0 B = A’B AB’ AB f(A,B) = A + B

8 IDABf(A,B)minterm A’B AB Another Example f(A,B)=B f(A,B)=A’B+AB=(A’+A)B=B

9 On the K-map: A = 0 A= 1 B= 0 B = A’B AB f(A,B)=B

10 IDABf(A,B)Maxterm 0000A+B A’+B 3111 Using Maxterms f(A,B)=(A+B)(A’+B)=(AA’)+B=0+B=B

The Maps: Representation of k-Variable Functions Boolean Expression Truth Table Cube K Map Binary Decision Diagram 11 (1,1,1)(1,1,0) (0,0,0)(0,0,1) (0,1,0) (0,1,1) (1,0,1) A cube of 3 variables: (A,B,C) C B A

Representation of k-Variable Func. Boolean Expression Truth Table Cube K Map Binary Decision Diagram 12 (0,1,1,1)(0,1,1,0) (0,0,0,0)(0,0,0,1)(1,0,0,1) (1,1,1,1) (1,1,0,1) (1,0,0,0) (0,0,1,0) (1,1,1,0) (0,0,1,1) (1,0,1,1) (0,1,0,1) (1,0,1,0) A cube of 4 variables: (A,B,C,D) D C B A

13 Three-Variable K-Map Id a b c f (a,b,c) f(0,0,0) f(0,0,1) f(0,1,0) f(0,1,1) f(1,0,0) f(1,0,1) f(1,1,0) f(1,1,1)

14 Three-Variable K-Map Id a b c f (a,b,c)

15 Corresponding K-map b = 1 c = 1 a = (0,0) (0,1) (1,1) (1,0) c = 0 Gray code f(a,b,c) = c’

16 Karnaugh Maps (K-Maps) Boolean expressions can be minimized by combining terms K-maps minimize equations graphically

17 Find rectangles to cover 1’s in adjacent entries. Rectangles can overlap but should not include 0’s. Use the rectangle that corresponds to a product term. K-map y(A,B)=A’B’C’+A’B’C= A’B’(C’+C)=A’B’

18 Another 3-Input example Id a b c f (a,b,c) Don’t Care Entry: “-” means the entry is not relevant either at input or output. In other words, we are free to assign either 0 or 1 to reduce the Boolean expression.

19 Corresponding K-map b = 1 c = 1 a = (0,0) (0,1) (1,1) (1,0) c = 0 f(a,b,c) = a + bc’

20 Yet another example Id a b c f (a,b,c,d)

21 Corresponding K-map b = 1 c = 1 a = (0,0) (0,1) (1,1) (1,0) c = 0 f(a,b,c) = b’

22 Quiz Given Boolean function, f(a,b,c)= a’b’+a’c’+bc’+ab+b’c 1.Write the truth table 2.Use Karnaugh map to derive the function in a minimal expression of sum of product form.

23 4-input K-map

24 4-input K-map

25 4-input K-map

26 K-maps with Don’t Cares

27 K-maps with Don’t Cares

28 K-maps with Don’t Cares