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.

Slides:

Advertisements

Similar presentations

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

Advertisements

CSEE 4823 Advanced Logic Design Handout: Lecture #2 1/22/15

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

CS2100 Computer Organisation K-maps: Finding PIs and EPIs (AY2014/5) Semester 2.

ITEC 352 Lecture 4 Boolean logic / Karnaugh Maps.

Gate-level Minimization

ECE C03 Lecture 21 Lecture 2 Two Level Minimization Hai Zhou ECE 303 Advanced Digital Design Spring 2002.

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.

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.

Chapter 3 Simplification of Switching Functions

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

CS 140 Lecture 6 Professor CK Cheng Tuesday 10/15/02.

Give qualifications of instructors: DAP

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

Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 4-1 Chapter #2: Two-Level Combinational Logic Section 2.3, Switches and Tools.

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.

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.

بهينه سازي با نقشة کارنو Karnaugh Map. 2  Method of graphically representing the truth table that helps visualize adjacencies 2-variable K-map 3-variable.

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

Simplifying Boolean Expressions Using K-Map Method

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

Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.

Optimization Algorithm

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.

Computer Engineering (Logic Circuits) (Karnaugh Map)

CS2100 Computer Organisation

CHAPTER 3: PRINCIPLES OF COMBINATIONAL LOGIC

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

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.

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.

CEC 220 Digital Circuit Design More Karnaugh Maps Monday, February 02 CEC 220 Digital Circuit Design Slide 1 of 11.

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.

CEC 220 Digital Circuit Design Implicants Wed, Sept. 23 CEC 220 Digital Circuit Design Slide 1 of 10.

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.

Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.

1 EENG 2710 Chapter 3 Simplification of Switching Functions.

Lecture 3: Incompletely Specified Functions and K Maps

Lecture #6 EGR 277 – Digital Logic

CSE 140: Components and Design Techniques for Digital Systems

Plotting functions not in canonical form

Optimized Implementation of Logic Function

ECE 331 – Digital System Design

Lecture 3: Incompletely Specified Functions and K Maps

Optimized Implementation of Logic Function

ECE 331 – Digital System Design

EECS 465: Digital Systems Lecture Notes # 2

CSE 140: Components and Design Techniques for Digital Systems

Optimization Algorithm

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

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 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 Derive prime implicants Derive the essential prime implicants Derive minimum expression

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

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) Essential Primes: Prime implicants covering elements in F that are not covered by any other primes. E.g.  m (0, 4),  m (14, 15) Min exp:  m (0, 4),  m (14, 15), (  m (3, 11) or  m (1,3) ) f(a,b,c,d) = a’b’c’ + abc’ + b’cd (or a’b’d)

Corresponding circuit f(a,b,c,d) a’ c’ d’ a b c b’ c d

Another example Given F =  m (3, 5), D =  m (0, 4) b c a Primes:  m (3),  m (4, 5) Essential Primes:  m (3),  m (4, 5) Min exp: f(a,b,c) = a’bc + ab’

5 variable K-map c d b e c d b e a Neighbors of 5 are: 1, 4, 13, 7, and 21 Neighbors of 10 are: 2, 8, 10,14, and 26

6 variable K-map d e c f d e c d e c f d e c a b f f

Min product of sums Given F =  m (3, 5), D =  m (0, 4) b c a Prime Implicates:  M (0,1),  M (0,2,4,6),  M (6,7) Essential Primes Implicates:  M (0,1),  M (0,2,4,6),  M (6,7) Min exp: f(a,b,c) = (a+b)(c )(a’+b’)

Corresponding Circuit a b a’ b’ c f(a,b,c,d)

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

Prime Implicates:  M (2,6),  M (2,10),  M (1,5,9,13),  M (5,7),  M (6,7),  M (8,9,10,11),  M (8,9,12,13) Essential Primes:  M (8,9,12,13) Min exp:  M (8,9,12,13)  M (5,7),  M (2,6),  M (8,9,10,11) or  M (6,7),  M (1,5,9,13),  M (2,10) f(a,b,c,d) = (a+b’+d’)(a’+c’+d)(a’+b)(a’+c)