Gate-Level Minimization1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

Slides:



Advertisements
Similar presentations
Chapter3: Gate-Level Minimization Part 2
Advertisements

Combinational Logic Circuits Chapter 2 Mano and Kime.
Gate-Level Minimization
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
K-Map Simplification COE 202 Digital Logic Design Dr. Aiman El-Maleh
Chapter 3 Simplification of Switching Functions. Karnaugh Maps (K-Map) A K-Map is a graphical representation of a logic function’s truth table.
ITEC 352 Lecture 4 Boolean logic / Karnaugh Maps.
Gate-level Minimization
Boolean Algebra and Combinational Logic
Gate-Level Minimization. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.
CSE-221 Digital Logic Design (DLD)
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Computer Engineering (Logic Circuits) (Karnaugh Map)
Boolean Algebra and Logic Gates1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Introduction Gate-level minimization refers to the design task of finding an optimal gate-level implementation of Boolean functions describing a digital.
بهينه سازي با نقشة کارنو Karnaugh Map. 2  Method of graphically representing the truth table that helps visualize adjacencies 2-variable K-map 3-variable.
Combinational Logic Circuits Chapter 2 Mano and Kime.
Overview Part 2 – Circuit Optimization 2-4 Two-Level Optimization
1 Fundamentals of Computer Science Propositional Logic (Boolean Algebra)
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.
Gate-Level Minimization Chapter 3. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.
D IGITAL L OGIC D ESIGN I G ATE -L EVEL M INIMIZATION.
Logic and Computer Design Simon Petruc-Naum CS 147 – Dr. S.M. Lee.
ES 244: Digital Logic Design Chapter 3 Chapter 3: Karnaugh Maps Uchechukwu Ofoegbu Temple University.
Chapter 3: Digital Logic Dr Mohamed Menacer Taibah University
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.
ECE 3110: Introduction to Digital Systems Symplifying Products of sums using Karnaugh Maps.
Combinational Logic Part 2: Karnaugh maps (quick).
Gate-Level Minimization
Gate-level Minimization
Chapter3: Gate-Level Minimization Part 1 Origionally By Reham S. Al-Majed Imam Muhammad Bin Saud University.
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
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.
Unit 1 Minimization Techniques and Logic Gates. Introduction to Digital Systems Analog devices and systems process time-varying signals that can take.
Gate-Level Minimization Gate-Level Minimization. Outline 3.1 Introduction 3.2 The map method 3.3 Four-variable map 3.4 Five-variable map 3.5 Product of.
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
Karnaugh Maps (K-Maps)
June 12, 2002© Howard Huang1 Karnaugh maps Last time we saw applications of Boolean logic to circuit design. – The basic Boolean operations are.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
Karnaugh Maps (K-Map) A K-Map is a graphical representation of a logic function’s truth table.
C.S.Choy39 TERMINOLOGY Minterm –product term containing all input variables of a function in either true or complementary form Maxterm – sum term containing.
ECE/CS 352 Digital System Fundamentals1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 2 – Part 5 Tom Kaminski & Charles R. Kime.
Karnaugh Map (K-Map) By Dr. M. Khamis Mrs. Dua’a Al Sinari.
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
Chapter 4 OPTIMIZED IMPLEMENTATION OF LOGIC FUNCTIONS.
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
Lecture 07 Digital logic By Amr Al-Awamry. 4 variables K-Map.
K-maps and Decoders Prof. Sin-Min Lee Department of Computer Science.
Fuw-Yi Yang1 數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi.
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
CHAPTER 3 Simplification of Boolean Functions
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
Gate-Level Minimization
Combinational Logic Circuits
ECE 2110: Introduction to Digital Systems
ECE 3110: Introduction to Digital Systems
Boolean Algebra and Combinational Logic
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
Universal gates.
Gate Level Minimization
Overview Part 2 – Circuit Optimization
Principles & Applications
Karnaugh Map Method By: Asst Lec. Besma Nazar Nadhem
Presentation transcript:

Gate-Level Minimization1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN

Gate-Level Minimization2 What is minimization?  Simplifying boolean expressions  Algebraic manipulations is hard since there is not a uniform way of doing it  Karnaugh map or K-map techniques is very commonly used

Gate-Level Minimization3 Two-Variable K-Map

Gate-Level Minimization4 Example

5 ExampleExample

6 Three-Variable K-Map

Gate-Level Minimization7 Three-Variable K-Map

Gate-Level Minimization8 Example

9 Note  In K-maps, you can have groups of 2, 4, 8, or 16  You cannot have groups of other combinations such as a group of 6

Gate-Level Minimization10 Exercises

Gate-Level Minimization11 Example  Represent F in the minimal format and draw the network diagram

Gate-Level Minimization12 Example  Represent F in the minimal format and draw the network diagram

Gate-Level Minimization13 Example  Represent F in the minimal format and draw the network diagram

Gate-Level Minimization14 Four-Variable K-Map

Gate-Level Minimization15 Four-Variable K-Map

Gate-Level Minimization16 Example  Represent F in the minimal format and draw the network diagram

Gate-Level Minimization17 Example  Represent F in the minimal format and draw the network diagram

Gate-Level Minimization18 Example  Represent F in the minimal format and draw the network diagram

Gate-Level Minimization19 Prime Implicants  You must cover all of the minterms  You must avoid redundancy  You must follow some rules  Prime Implicant  A product term that is generated by combining the maximum number of adjacent squares in the map  Essential Prime Implicant  A minterm that is covered by only one prime implicant

Gate-Level Minimization20 Maxterm Simplification  Remember

Gate-Level Minimization21 Example  Simplify F in product of sums

Gate-Level Minimization22 Example (cont)  Step – 1  Fill the K-map for F

Gate-Level Minimization23 Example (cont)  Step – 1  Fill the K-map for F

Gate-Level Minimization24 Example (cont)  Step – 2  Fill zeros in the rest of the squares

Gate-Level Minimization25 Example (cont)  Step – 3  Cover zeros. This is your F’

Gate-Level Minimization26 Important

Gate-Level Minimization27 Don’t Care Conditions  A network is usually composed of sub- networks  Net-1 may not produce all combinations of A,B, and C  In this case, F don’t care about those combinations ABCABC F Net-1Net-2

Gate-Level Minimization28 Don’t Care Conditions x x 1 1 X can be considered as 0 or 1, whichever is more convenient

Gate-Level Minimization29 NAND/NOR Implementations  AND, OR, and NOT gates can be used to construct the digital systems  However, it is easier to fabricate NAND and NOR gates  So try to replace AND, OR, and NOT gates with NAND or NOR gates

Gate-Level Minimization30 NAND Implementation  First implement with AND-OR  Put bubble at the output of each AND gate  Put bubbles at the inputs of each OR gate  Place necessary inverters

Gate-Level Minimization31 Example

Gate-Level Minimization32 Example

Gate-Level Minimization33 Example

Gate-Level Minimization34 NOR Implementation  First implement with AND-OR  Put bubble at the inputs of each AND gate  Put bubbles at the output of each OR gate  Place necessary inverters

Gate-Level Minimization35 Example

Gate-Level Minimization36 Study Problems  Course Book Chapter – 3 Problems  3– 1  3 – 3  3 – 5  3 – 7  3 – 12  3 – 15  3 – 18

Gate-Level Minimization37 Questions