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

Slides:

Advertisements

Similar presentations

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

Advertisements

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

ITEC 352 Lecture 4 Boolean logic / Karnaugh Maps.

Gate-level Minimization

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

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.

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

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

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

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.

Simplifying Boolean Expressions Using K-Map Method

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

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

CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2003 Topic 5: Quine-McCluskey Method José Nelson Amaral.

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.

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:

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

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.

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.

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

Lecture 3: Incompletely Specified Functions and K Maps

Computer Organisation

CSE 140: Components and Design Techniques for Digital Systems

Plotting functions not in canonical form

ECE 331 – Digital System Design

Lecture 3: Incompletely Specified Functions and K Maps

Optimized Implementation of Logic Function

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

ECE 331 – Digital System Design

Chapter 3 Gate-level Minimization.

COE 202: Digital Logic Design Combinational Logic Part 3

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:

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

Part I. Combinational Logic –Implementation K-map

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

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

Boolean Expression K-Map Each Variable x i and its compliment x i ’  Two half planes Rx i, Rx i ’ divided by x i Each product term P (  Xi* e.g. b’c’)  Intersection of Rx i * for all i  P. (A rectangle e.g. Rb’ Rc’) Each minterm  1-cell Two minterms are adjacent if they differ by one variable, eg: abc’d is adjacent to abc’d’  The two cells are neighbors Each minterm has n adjacent neighbors  Each cell has n neighbors U

Another example – 3 bits Id a b c f (a,b,c,d) f(a, b, c, d) = a’ + bc

Corresponding K-map b c a

One more 4 bit example: f(a,b,c,d) = a’ + bc Id a b c d f (a,b,c,d)

Corresponding K-map b c a d

Given a K-map, derive a minimal Boolean expression in sum of products form (or product of sums). Obj: minimal # of terms, minimal # of literals. Hints: # of terms => # of rectangles # of literals => inverse of the size of rectangles (if the size of the rectangle is larger, then we can reduce literals) We want to find the minimum number of rectangles in their largest sizes to cover the On Set.

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