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

Slides:

Advertisements

Similar presentations

CSE20 Lecture 15 Karnaugh Maps Professor CK Cheng CSE Dept. UC San Diego 1.

Advertisements

CS 140 Lecture 16 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.

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

Based on slides by: Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 8 – Systematic Simplification.

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.

Examples Simplify: ab’c + abc + a’bc Show that X + X’Y = X + Y

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

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.

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

CS 140 Lecture 6 Professor CK Cheng Tuesday 10/15/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.

Give qualifications of instructors: DAP

Lecture 1: Introduction to Digital Logic Design CK Cheng Tuesday 4/1/02.

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.

Computer Engineering (Logic Circuits) (Karnaugh 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.

ECE 301 – Digital Electronics Karnaugh Maps and Determining a Minimal Cover (Lecture #8) The slides included herein were taken from the materials accompanying.

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.

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

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.

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.

ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.

Examples. Examples (1/11)  Example #1: f(A,B,C,D) =  m(2,3,4,5,7,8,10,13,15) Fill in the 1’s. 1 1 C A B CD AB D 1 1.

Converting to Minterms Form

1 Quine-McCluskey Method. 2 Motivation Karnaugh maps are very effective for the minimization of expressions with up to 5 or 6 inputs. However they are.

Computer Engineering (Logic Circuits) (Karnaugh Map)

Chapter3: Gate-Level Minimization Part 1 Origionally By Reham S. Al-Majed Imam Muhammad Bin Saud University.

CS2100 Computer Organisation

07 KM Page 1 ECEn/CS 224 Karnaugh Maps. 07 KM Page 2 ECEn/CS 224 What are Karnaugh Maps? A simpler way to handle most (but not all) jobs of manipulating.

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

CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC

1 Example: Groupings on 3-Variable K-Maps BC F(A,B,C) = A ’ B ’ A BC F(A,B,C) = B ’ A

 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.

Karnaugh Maps (K maps).

EECS 270 Lecture 10. K-map “rules” – Only circle adjacent cells (remember edges are adjacent!) – Only circle groups that are powers of 2 (1, 2,

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

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

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.

Lecture 3: Incompletely Specified Functions and K Maps

CSE 140: Components and Design Techniques for Digital Systems

Optimized Implementation of Logic Function

Lecture 3: Incompletely Specified Functions and K Maps

Optimized Implementation of Logic Function

CSE140 HW2 Preparation Xinyuan Wang 04/20/2018.

ECE 331 – Digital System Design

Digital Logic & Design Dr. Waseem Ikram Lecture 12.

EECS 465: Digital Systems Lecture Notes # 2

CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions

CSE 140: Components and Design Techniques for Digital Systems

Chapter 3 Gate-level Minimization.

Optimized Implementation of Logic Function

COE 202: Digital Logic Design Combinational Logic Part 3

CSE 140 Lecture 3 Combinational Logic: Implementation

3-Variable K-map AB/C AB/C A’B’ A’B AB AB’

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:

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

Part I. Combinational Logic –Implementation K-map 2

4-Variable K-Maps: An example f(a,b,c,d) Id a b c d f (a,b,c,d)

Corresponding K-map f (a, b, c, d) = c b c a d

Another example w/ 4 bits: Id a b c d f (a,b,c,d)

Corresponding 4-variable K-map f (a, b, c, d) = b’c’ + b’d’ + acd’ b c a d

Boolean Expression K-Map Variable x i and its compliment x i ’  Two half planes Rx i, and Rx i ’ Product term P (  x i * e.g. b’c’)  Intersect of Rx i * for all i in P e.g. Rb’ intersect Rc’ Each minterm  One element cell Two minterms are adjacent iff they differ by one and only one variable, eg: abc’d, abc’d’  The two cells are neighbors Each minterm has n adjacent minterms  Each cell has n neighbors 7

ProcedureInput: Two sets of F R D 1)Draw K-map. 2)Expand all terms in F to their largest sizes (prime implicants). 3)Choose the essential prime implicants. 4)Try all combinations to find the minimal sum of products. (This is the most difficult step) 8

4-input K-map 9

10

K-maps with Don’t Cares 11

K-maps with Don’t Cares 12

Example Given F =  m (0, 1, 2, 8, 14) D =  m (9, 10) 1. Draw K-map b c a d

2. Prime Implicants: Largest rectangles that intersect On Set but not Off Set that correspond to product terms.  m (0, 1, 8, 9),  m (0, 2, 8, 10),  m (10, 14) 3. Essential Primes: Prime implicants covering elements in F that are not covered by any other primes.  m (0, 1, 8, 9),  m (0, 2, 8, 10),  m (10, 14) 4. Min exp:  m (0, 1, 8, 9) +  m (0, 2, 8, 10) +  m (10, 14) f(a,b,c,d) = b’c’ + b’d’+ acd’ 14

Another example Given F =  m (0, 3, 4, 14, 15) D =  m (1, 11, 13) 1. Draw K-map b c a d

2. Prime Implicants: Largest rectangles that intersect On Set but not Off Set that correspond to product terms. E.g.  m (0, 4),  m (0, 1),  m (1, 3),  m (3, 11),  m (14, 15),  m (11, 15),  m (13, 15) 3. Essential Primes: Prime implicants covering elements in F that are not covered by any other primes. E.g.  m (0, 4),  m (14, 15) 4. Min exp:  m (0, 4),  m (14, 15), (  m (3, 11) or  m (1,3) ) f(a,b,c,d) = a’c’d’+ abc+ b’cd (or a’b’d) 16