ECE/CS 352 Digital System Fundamentals1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 2 – Part 6 Tom Kaminski & Charles R. Kime.

Slides:

Advertisements

Similar presentations

Techniques for Combinational Logic Optimization

Advertisements

Quine-McCluskey Method

FUNCTION OPTIMIZATION Switching Function Representations can be Classified in Terms of Levels Number of Levels, k, is Number of Unique Boolean (binary)

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.

ECE C03 Lecture 31 Lecture 3 Two-Level Logic Minimization Algorithms Hai Zhou ECE 303 Advanced Digital Design Spring 2002.

ECE 3110: Introduction to Digital Systems Simplifying Sum of Products using Karnaugh Maps.

ELEC Digital Logic Circuits Fall 2008 Logic Minimization (Chapter 3) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and.

Chapter 3 Simplification of Switching Functions. Karnaugh Maps (K-Map) A K-Map is a graphical representation of a logic function’s truth table.

Gate-level Minimization

Chapter 3 Simplification of Switching Functions

Two-Level Logic Synthesis -- Quine-McCluskey Method.

SYEN 3330 Digital Systems Jung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 6.

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.

SYEN 3330 Digital Systems Jung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 5.

EECC341 - Shaaban #1 Lec # 7 Winter Combinational Circuit Minimization Canonical sum and product logic expressions do not provide a circuit.

/t/ / I d/ /d/ Try Again Go on /t/ / I d/ /d/

Simplifying Boolean Expressions Using K-Map Method

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

ECE/CS 352 Digital System Fundamentals© T. Kaminski & C. Kime 1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 4 – Part 3 Tom Kaminski & Charles.

2-Level Minimization Classic Problem in Switching Theory

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

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.

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.

Wednesday, 25 Feb 2000 Reminder: Home Work #5 due 28 Feb (Monday) Goal: finish chapter 3 by end of 6th week Office hours: Wed: 11m to 1pm AND 3pm to 5pm.

2-Level Minimization Classic Problem in Switching Theory Tabulation Method Transformed to “Set Covering Problem” “Set Covering Problem” is Intractable.

Logic and Computer Design Simon Petruc-Naum CS 147 – Dr. S.M. Lee.

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

UM EECS 270 Spring 2011 – Taken from Dr.Karem Sakallah Logic Synthesis: From Specs to Circuits Implementation Styles –Random –Regular Optimization Criteria.

Two Level Networks. Two-Level Networks Slide 2 SOPs A function has, in general many SOPs Functions can be simplified using Boolean algebra Compare the.

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.

ECE2030 Introduction to Computer Engineering Lecture 8: Quine-McCluskey Method Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering.

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.

1 ECE2030 Introduction to Computer Engineering Lecture 8: Quine-McCluskey Method Prof. Hsien-Hsin Sean Lee School of ECE Georgia Institute of Technology.

Computer Engineering (Logic Circuits) (Karnaugh Map)

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

ECE/CS 352 Digital System Fundamentals© T. Kaminski & C. Kime 1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 2 Part 7 Tom Kaminski & Charles.

ece Parity Used to check for errors Can be either ODD or EVEN Left most bit used as the indicator For EVEN, insert a 0 or a 1 so as to make the.

ECE 3110: Introduction to Digital Systems Chapter #4 Review.

Copied with Permission from prof. Mark PSU ECE

ECE/CS 352 Digital System Fundamentals© T. Kaminski & C. Kime 1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 2 Part 3 Tom Kaminski & Charles.

ECE/CS 352 Digital System Fundamentals© T. Kaminski & C. Kime 1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 6 – Part 2 Tom Kaminski & Charles.

Karnaugh Maps (K-Map) A K-Map is a graphical representation of a logic function’s truth table.

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

ECE/CS 352 Digital System Fundamentals1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 2 – Part 5 Tom Kaminski & Charles R. Kime.

ECE/CS 352 Digital System Fundamentals© T. Kaminski & C. Kime 1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 4 – Part 4 Tom Kaminski & Charles.

ECE/CS 352 Digital System Fundamentals© T. Kaminski & C. Kime 1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 3 -Part 2 Tom Kaminski & Charles.

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

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

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.

CHAPTER 6 Quine-McCluskey Method

Lecture #6 EGR 277 – Digital Logic

QUINE-McCLUSKEY METHOD

ECE/CS 352 Digital Systems Fundamentals

ECE 2110: Introduction to Digital Systems

ECE/CS 352 Digital Systems Fundamentals

ECE 331 – Digital System Design

ECE 331 – Digital System Design

Chapter 2: Digital Image Fundamentals

Chapter 2: Digital Image Fundamentals

SYEN 3330 Digital Systems Chapter 2 – Part 5 SYEN 3330 Digital Systems.

CSC 220: Computer Organization Logic Gates and Functions

SYEN 3330 Digital Systems Chapter 2 – Part 6 SYEN 3330 Digital Systems.

CHAPTER 6 QUINE-McCLUSKEY METHOD

ECE 331 – Digital System Design

ECE/CS 352 Digital Systems Fundamentals

Presentation transcript:

ECE/CS 352 Digital System Fundamentals1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 2 – Part 6 Tom Kaminski & Charles R. Kime

ECE/CS 352 Digital System Fundamentals Chapter 2 2 Table Methods for PI Generation

ECE/CS 352 Digital System Fundamentals Chapter 2 3 An Example: F(x,y,z)=  m(2,3,6,7)

ECE/CS 352 Digital System Fundamentals Chapter 2 4 Results - Step 2

ECE/CS 352 Digital System Fundamentals Chapter 2 5 Step 3

ECE/CS 352 Digital System Fundamentals Chapter 2 6 The Results of Step 3

ECE/CS 352 Digital System Fundamentals Chapter 2 7 Computational Complexity Issues

ECE/CS 352 Digital System Fundamentals Chapter 2 8 Q-M on F(x,y,z)=  m(2,3,6,7)

ECE/CS 352 Digital System Fundamentals Chapter 2 9 The Result of Step 3

ECE/CS 352 Digital System Fundamentals Chapter 2 10 Result of Step 4

ECE/CS 352 Digital System Fundamentals Chapter 2 11 Review of Boolean Logic

ECE/CS 352 Digital System Fundamentals Chapter 2 12 Canonical Forms

ECE/CS 352 Digital System Fundamentals Chapter 2 13 Minimum Literal SOP Form

ECE/CS 352 Digital System Fundamentals Chapter 2 14 Tabular Method to Find a Cover

ECE/CS 352 Digital System Fundamentals Chapter 2 15 Table Method Example

ECE/CS 352 Digital System Fundamentals Chapter 2 16 Select Essential Prime Implicants

ECE/CS 352 Digital System Fundamentals Chapter 2 17 Less Than Prime Implicants

ECE/CS 352 Digital System Fundamentals Chapter 2 18 Secondary Essential PIs

ECE/CS 352 Digital System Fundamentals Chapter 2 19 Cyclic Structures

ECE/CS 352 Digital System Fundamentals Chapter 2 20 Cyclic Structure: Pick One

ECE/CS 352 Digital System Fundamentals Chapter 2 21 Less Thans

ECE/CS 352 Digital System Fundamentals Chapter 2 22 Secondary Essential PIs

ECE/CS 352 Digital System Fundamentals Chapter 2 23 Now Go Back and Try Again

ECE/CS 352 Digital System Fundamentals Chapter 2 24 Finish Up

ECE/CS 352 Digital System Fundamentals Chapter 2 25 Minimum SOP to Minimum POS

ECE/CS 352 Digital System Fundamentals Chapter 2 26 Minimum POS Example Given g(w,x,y,z):Form the Complement (Circle Zeros):

ECE/CS 352 Digital System Fundamentals Chapter 2 27 Table Method Minimum SOP