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

Slides:



Advertisements
Similar presentations
Techniques for Combinational Logic Optimization
Advertisements

KU College of Engineering Elec 204: Digital Systems Design
Gate-Level Minimization
Overview Part 1 – Gate Circuits and Boolean Equations
K-Map Simplification COE 202 Digital Logic Design Dr. Aiman El-Maleh
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.
Gate-level Minimization
Chapter 3 Simplification of Switching Functions
Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal approach to simplification that is.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
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.
Simplifying Boolean Expressions Using K-Map Method
Overview Part 2 – Circuit Optimization 2-4 Two-Level Optimization
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
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.
Department of Computer Engineering
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.
Optimization Algorithm
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.
ECE 3110: Introduction to Digital Systems Symplifying Products of sums using Karnaugh Maps.
Combinational Logic Part 2: Karnaugh maps (quick).
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.
Computer Engineering (Logic Circuits) (Karnaugh Map)
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 (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.
1 Gate Level Minimization EE 208 – Logic Design Chapter 3 Sohaib Majzoub.
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
Karnaugh Maps (K maps).
ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)
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.
CHAPTER 3 Principles of Combinational Logic (Sections )
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
Minimization of Circuits
Computer Organisation
Plotting functions not in canonical form
EEL 3705 / 3705L Digital Logic Design
CSCE 211: Digital Logic Design
ECE 331 – Digital System Design
Digital Logic & Design Dr. Waseem Ikram Lecture 13.
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
Karnaugh Mapping Karnaugh Mapping Digital Electronics
SYEN 3330 Digital Systems Chapter 2 – Part 4 SYEN 3330 Digital Systems.
Karnaugh Mapping Digital Electronics
Karnaugh Mapping Karnaugh Mapping Digital Electronics
Optimization Algorithm
Karnaugh Maps Introduction Venn Diagrams 2-variable K-maps
Karnaugh Mapping Digital Electronics
Chapter 3 Gate-level Minimization.
MINTERMS and MAXTERMS Week 3
SYEN 3330 Digital Systems Chapter 2 – Part 6 SYEN 3330 Digital Systems.
COE 202: Digital Logic Design Combinational Logic Part 3
Gate Level Minimization
Minimization of Switching Functions
Overview Part 2 – Circuit Optimization
Karnaugh maps Last time we saw applications of Boolean logic to circuit design. The basic Boolean operations are AND, OR and NOT. These operations can.
Basic circuit analysis and design
Simplification of Boolean Functions using K-Maps
ECE 331 – Digital System Design
Presentation transcript:

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

Three-Variable Maps Reduced literal product terms for SOP standard forms correspond to rectangles on K-maps containing cell counts that are powers of 2. Rectangles of 2 cells represent 2 adjacent minterms; of 4 cells represent 4 minterms that form a “pairwise adjacent” ring. Rectangles can be in many different positions on the K-map since adjacencies are not confined to cells truly next to each other. SYEN 3330 Digital Systems

Three-Variable Maps Topological warps of 3-variable K-maps that show all adjacencies: Venn Diagram  Cylinder X 4 Y 6 Z 5 7 3 2 1 SYEN 3330 Digital Systems

Three-Variable Maps Example Shapes of Rectangles: X Y Z X Y Z 1 3 2 1 3 2 4 5 7 6 SYEN 3330 Digital Systems

Three Variable Maps F(x,y,z) = x y+ z SYEN 3330 Digital Systems

Three-Variable Map Simplification F(X,Y,Z) = (0,1,2,4,6,7) SYEN 3330 Digital Systems

Four Variable Maps x y z w x y z w m0 m1 m2 m3 m4 m5 m6 m7 m8 m9 m10 SYEN 3330 Digital Systems

Four Variable Terms Four variable maps can have terms of: Single one = 4 variables, (i.e. Minterm) Two ones = 3 variables, Four ones = 2 variables Eight ones = 1 variable, Sixteen ones = zero variables (i.e. Constant "1") SYEN 3330 Digital Systems

Four-Variable Maps Example Shapes of Rectangles: Y Y 1 3 2 X W 4 5 1 3 2 X W 4 5 7 6 X 12 13 15 14 W 11 10 8 9 X Z Z Z SYEN 3330 Digital Systems

Four-Variable Map Simplification F(W,X,Y,Z) = (0, 2,4,5,6,7,8,10,13) SYEN 3330 Digital Systems

Four-Variable Map Simplification F(W,X,Y,Z) = (3,4,5,7,13,14,15) SYEN 3330 Digital Systems

Systematic Simplification A Prime Implicant is a product term obtained by combining the maximum possible number of adjacent squares in the map. A prime implicant is called an Essential Prime Implicant if it is the only prime implicant that covers (includes) one or more minterms. Prime Implicants and Essential Prime Implicants can be determined by inspection of the K-Map. A set of prime implicants that "covers all minterms" means that, for each minterm of the function, there is at least one prime implicant in the selected set of prime implicants that includes the minterm. SYEN 3330 Digital Systems

Example of Prime Implicants SYEN 3330 Digital Systems

Prime Implicant Practice F(A,B,C,D) = (0,2,3,8,9,10,11,12,13,14,15) SYEN 3330 Digital Systems

Systematic Approach (No Don’t Cares) Select all Essential PI’s Find and delete all Less Than PI’s Repeat 1) and 2) until all minterms are covered If Cycles Occur: Arbitrarily select a PI and generate a cover. Delete the selected PI and generate a new cover Select the cover with fewer literals If a new cycle appears, repeat steps 4), 5), and 6) and compare all solutions for the best. SYEN 3330 Digital Systems

Other PI Selection SYEN 3330 Digital Systems

Example 2 from Supplement 1 SYEN 3330 Digital Systems

Example 2 (Continued) SYEN 3330 Digital Systems

Another Example G(A,B,C,D) =  (0,2,3,4,7,12,13,14,15) SYEN 3330 Digital Systems

Five Variable or More K-Maps SYEN 3330 Digital Systems

Don't Cares in K-Maps Sometimes a function table contains entries for which it is known the input values will never occur. In these cases, the output value need not be defined. By placing a “don't care” in the function table, it may be possible to arrive at a lower cost logic circuit. “Don't cares” are usually denoted with an "x" in the K-Map or function table. Example of “Don't Cares” - A logic function defined on 4-bit variables encoded as BCD digits where the four-bit input variables never exceed 9, base 2. Symbols 1010, 1011, 1100, 1101, 1110, and 1111 will never occur. Thus, we DON'T CARE what the function value is for these combinations. “Don't cares“are used in minimization procedures in such a way that they may ultimately take on either a 0 or 1 value in the result. SYEN 3330 Digital Systems

Example: BCD “5 or More” SYEN 3330 Digital Systems

Product of Sums Example F(A,B,C,D) =  (3,9,11,12,13,14,15) + d (1,4,6) SYEN 3330 Digital Systems