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

Slides:



Advertisements
Similar presentations
KU College of Engineering Elec 204: Digital Systems Design
Advertisements

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,
SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 4.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
Combinational Logic Circuits Chapter 2 Mano and Kime.
Overview Part 2 – Circuit Optimization 2-4 Two-Level Optimization
Boolean Algebra and Logic Simplification
KU College of Engineering Elec 204: Digital Systems Design
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
Department of Computer Engineering
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.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. Circuit Optimization Logic and Computer Design Fundamentals.
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
Circuit Minimization. It is often uneconomical to realize a logic directly from the first logic expression that pops into your head. Canonical sum and.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.
A.Abhari CPS2131 Chapter 3: Gate-Level Minimization Topics in this Chapter: The Map Method Two-Variable Map Three- Variable Map Four/Five variable Map.
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
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.
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
CS151 Introduction to Digital Design Chapter Map Simplification.
C.S.Choy39 TERMINOLOGY Minterm –product term containing all input variables of a function in either true or complementary form Maxterm – sum term containing.
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.
Based on slides by:Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 7 – Karnaugh Maps.
Digital Logic & Design Dr. Waseem Ikram Lecture 09.
Digital Systems Design 1 Signal Expressions Multiply out: F = ((X + Y)  Z) + (X  Y  Z) = (X  Z) + (Y  Z) + (X  Y  Z)
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.
CHAPTER 3 Simplification of Boolean Functions
ECE 2110: Introduction to Digital Systems
Computer Organisation
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture)
ECE 3110: Introduction to Digital Systems
ECE/CS 352 Digital Systems Fundamentals
Dr. Clincy Professor of CS
Princess Sumaya University
ECE 2110: Introduction to Digital Systems
Karnaugh Maps.
Optimized Implementation of Logic Function
ECE 331 – Digital System Design
Digital Logic and Design
Karnaugh Maps (K-Maps)
Boolean Algebra Why study Boolean Algebra?
E- Lesson: Karnaugh Maps (K-Map ).
17-Nov-18 Logic Algebra 1 Combinational logic.
Boolean Algebra.
Optimized Implementation of Logic Function
Dr. Clincy Professor of CS
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
ECE 331 – Digital System Design
ECE 331 – Digital System Design
ECE 331 – Digital System Design
Karnaugh Mapping Digital Electronics
MINTERMS and MAXTERMS Week 3
Optimized Implementation of Logic Function
SYEN 3330 Digital Systems Chapter 2 Part 3 SYEN 3330 Digital Systems.
Computer Organization
ECB2212-Digital Electronics K-Map
CS Chapter 3 (3A and ) – Part 3 of 5
Overview Part 2 – Circuit Optimization
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Karnaugh Maps (K maps).
Analysis of Logic Circuits Example 1
Karnaugh Maps (K-Maps)
Laws & Rules of Boolean Algebra
Circuit Simplification and
Presentation transcript:

SYEN 3330 Digital Systems Chapter 2 – Part 4 SYEN 3330 Digital Systems

Standard Forms SYEN 3330 Digital Systems

Standard Sum-of-Products (SOP) SYEN 3330 Digital Systems

Standard Sum-of-Products (SOP) The Canonical Sum-of-Minterms form has (5 * 3) = 15 literals and 5 terms. The reduced SOP form has 3 literals and 2 terms. SYEN 3330 Digital Systems

AND/OR Two-level Implementation of SOP Expression SYEN 3330 Digital Systems

Standard Product-of-Sums (POS) SYEN 3330 Digital Systems

Standard Product-of-Sums (POS) SYEN 3330 Digital Systems

Standard Product-of-Sums (POS) The Canonical Product-of-Maxterms form had (3 * 3) = 9 literals and 3 terms. The reduced POS form had 4 literals and 2 terms. SYEN 3330 Digital Systems

OR/AND Two-level Implementation SYEN 3330 Digital Systems

SOP and POS Observations SYEN 3330 Digital Systems

Equivalent Cost Circuits SYEN 3330 Digital Systems

Boolean Function Simplification Reducing the literal cost of a Boolean Expression leads to simpler networks. Simpler networks are less expensive to implement. Boolean Algebra can help us minimize literal cost. When do we stop trying to reduce the cost? Do we know when we have a minimum? We will introduce a systematic way to arrive a a minimum cost, two-level POS or SOP network. SYEN 3330 Digital Systems

Karnaugh Maps (K-map) SYEN 3330 Digital Systems

Uses of Karnaugh Maps Provide a means for finding optimum: Simple SOP and POS standard forms, and Small two-level AND/OR and OR/AND circuits Visualize concepts related to manipulating Boolean expressions Demonstrate concepts used by computer-aided design programs to simplify large circuits SYEN 3330 Digital Systems

Two Variable Maps A Two variable Karnaugh Map: SYEN 3330 Digital Systems

K-Map and Function Tables SYEN 3330 Digital Systems

K-Map Function Representations For function F(x,y), the two adjacent cells containing 1’s can be combined using the Minimization Theorem: For G(x,y), two pairs of adjacent cells containing 1’s can be combined using the Minimization Theorem: Duplicate x y SYEN 3330 Digital Systems

Three Variable Maps SYEN 3330 Digital Systems

Example Functions SYEN 3330 Digital Systems

Combining Squares By combining squares, we reduce the representation for a term, reducing the number of literals in the Boolean equation. On a three-variable K-Map: SYEN 3330 Digital Systems

Combining Squares Example SYEN 3330 Digital Systems

Alternate K-Map Diagram x y z m0 m1 m3 m2 m4 m5 m7 m6 yz 1 00 01 11 10 SYEN 3330 Digital Systems