Digital Logic Design Lecture 13. Announcements HW5 up on course webpage. Due on Tuesday, 10/21 in class. Upcoming: Exam on October 28. Will cover material.

Slides:

Advertisements

Similar presentations

Abdullah Said Alkalbani University of Buraimi

Advertisements

Date of Birth Design Problem

CSE 370 Sample Final Exam Questions. 1) Logic Minimization CD AB F = Σm(0,6,7,8,9,11,15) + d(1,13)

- 1 - Using an SMT Solver and Craig Interpolation to Detect and Remove Redundant Linear Constraints in Representations of Non-Convex Polyhedra Christoph.

Register Transfer and Microoperations Part2

Principles & Applications

15 October 2013Birkbeck College, U. London1 Introduction to Computer Systems Lecturer: Steve Maybank Department of Computer Science and Information Systems.

A Simple ALU Binary Logic.

Princess Sumaya University

Introduction to CAFE Yu Hen Hu September 25, 2000.

Truth Tables & Logic Expressions

Truth Tables and Logic Gates. What are Logic Gates? Logic gates are components used in making logic circuits. Each gate has one or more inputs and produces.

Lab02 :Logic Gate Fundamentals:

Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.

Karnaugh Map Adjacent Squares

Basics Combinational Circuits Sequential Circuits

Digital Logic Design Gate-Level Minimization

Boolean Algebra and Logic Gates

Logic Gates & Circuits. AND Gate Input AInput BOutput X AND Logic Gate AND Truth Table X = A. B AND Boolean Expression.

Chapter 3 Digital Logic Structures

Karnaugh Map Adjacent Squares

CS 121 Digital Logic Design

CS1022 Computer Programming & Principles

CS 121 Digital Logic Design

CS 121 Digital Logic Design

Karnaugh Maps ECEn/CS 224.

Binary Lesson 3 Hexadecimal. Counting to 15 Base Base Base 16 Base Base Base 16 Two Ten (Hex) Two Ten (Hex)

Binary Lesson 3 Hexadecimal. Counting to 15 Base Base Base 16 Base Base Base 16 Two Ten (Hex) Two Ten (Hex)

CS 121 Digital Logic Design

Princess Sumaya University

Digital Logic & Design Lecture No. 3. Number System Conversion Conversion between binary and octal can be carried out by inspection.  Each octal digit.

ENEE244-02xx Digital Logic Design Lecture 10. Announcements HW4 due 10/9 – Please omit last problem 4.6(a),(c) Quiz during recitation on Monday (10/13)

KU College of Engineering Elec 204: Digital Systems Design

Minimization of Circuits

Quine-McCluskey Method

ELECTRONICS TECHNOLOGY Digital Devices I Karnaugh Maps

Digital Logic Design Lecture 14 based on video from:

Number Systems Decimal Binary Denary Octal Hexadecimal Click the mouse or Press the space bar to Continue.

Synthesis For Finite State Machines. FSM (Finite State Machine) Optimization State tables State minimization State assignment Combinational logic optimization.

Node Optimization. Simplification Represent each node in two level form Use espresso to minimize each node Several simplification procedures which vary.

Min terms and logic expression

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

ENGIN112 L9: More Karnaugh Maps September 22, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 9 More Karnaugh Maps and Don’t Cares.

Gate-Level Minimization

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

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

ENEE244-02xx Digital Logic Design Lecture 7. Announcements Homework 3 due on Thursday. Review session will be held by Shang during class on Thursday.

ENEE244-02xx Digital Logic Design Lecture 10. Announcements HW4 assigned, due 10/9.

Simplifying Boolean Expressions Using K-Map Method

Computer Architecture I: Digital Design Dr. Robert D. Kent Lecture 3 Simplification of Boolean Expressions.

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

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

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. Circuit Optimization Logic and Computer Design Fundamentals.

Computer Organization CSC 405 Quine-McKluskey Minimization.

PRASAD A. PAWASKAR SPN. NO DETE 2 SEMESTER lec1-11.

ENEE244-02xx Digital Logic Design Lecture 12. Announcements HW4 due today HW5 is up on course webpage. Due on 10/16. Recitation quiz on Monday, 10/13.

ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept.

CHAPTER 6 Quine-McCluskey Method

ECE 2110: Introduction to Digital Systems

ECE 3110: Introduction to Digital Systems

QUINE-McCLUSKEY METHOD

ECE 331 – Digital System Design

CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions

Optimization Algorithm

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

Chapter 3 Gate-level Minimization.

Overview Part 2 – Circuit Optimization

CHAPTER 6 QUINE-McCLUSKEY METHOD

ECE 331 – Digital System Design

Presentation transcript:

Digital Logic Design Lecture 13

Announcements HW5 up on course webpage. Due on Tuesday, 10/21 in class. Upcoming: Exam on October 28. Will cover material from Chapter 4. Details to follow soon.

Agenda Last time – Using 3,4 variable K-Maps to find minimal expressions (4.5) This time – Minimal expressions for incomplete Boolean functions (4.6) – 5 and 6 variable K-Maps (4.7) – Petrick’s method of determining irredundant expressions (4.9)

Minimal Expressions of Incomplete Boolean Functions Recall an incomplete Boolean function has a truth table which contains dashed functional entries indicating don’t-care conditions. Idea: Can replace don’t-care entries with either 0s or 1s in order to form the largest possible subcubes.

Example

Example

Example Step 1: Find prime implicants (pretend don’t care cells set to 1)

Example Step 2: Find essential prime implicants (discount don’t care cells)

Example Step 3: Add prime implicants to cover all 1-cells (discount don’t care cells)

Example Step 3: Add prime implicants to cover all 1-cells (discount don’t care cells)

Five and Six Variable K-Maps

Five Variable K-Maps We can visualize five-variable map in two different ways:

Five Variable K-Maps

Five Variable K-Maps

Example

Step 1: Find all Prime Implicants

Example Step 2: Find all Essential Prime Implicants

Example Step 2: Find all Essential Prime Implicants

Example Step 2: Find all Essential Prime Implicants

Six Variable K-Maps We can visualize a six-variable map in two different ways:

Six Variable K-Maps

Six Variable K-Maps Subcubes: Subcubes occurring in corresponding positions on all four layers collectively form a single subcube.

An Algorithm for the Final Step in Expression Minimization

Petrick’s Method of Determining Irredundant Expressions AX BXXX CXXX DXXX EXX FX GXX HXX IXX The covering problem: Determine a subset of prime implicants that covers the table. A minimal cover is an irredundant cover that corresponds to a minimal sum of the function.

Petrick’s Method of Determining Irredundant Expressions AX BXXX CXXX DXXX EXX FX GXX HXX IXX p-expression: (G+H)(F+G)(A+B)(B+C)(H+I)(D+I)(C+D)(B+C+E)(D+E) The p-expression equals 1 iff a sufficient subset of prime implicants is selected.

P-expressions If a p-expression is manipulated into its sum-of- products form using the distributive law, duplicate literals deleted in each resulting product term and subsuming product temrms deleted, then each remaining product term represents an irredundant cover of the prime implicant table. Since all subsuming product terms have been deleted, the resulting product terms must each describe an irredundant cover. The irredundant DNF is obtained by summing the prime implicants indicated by the variables in a product term.

Simplifying p-expressions

Finding Minimal Sums