Chapter 5 Boolean Algebra and Reduction Techniques 1.

Slides:



Advertisements
Similar presentations
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Advertisements

Prof. Sin-Min Lee Department of Computer Science
Boolean Algebra and Reduction Techniques
Boolean Algebra and Combinational Logic
CHAPTER 4 Boolean Algebra and Logic Simplification
SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 4.
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
Combinational Logic Discussion D2.5. Combinational Logic Combinational Logic inputsoutputs Outputs depend only on the current inputs.
Digital Fundamentals Floyd Chapter 4 Tenth Edition
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Computer Engineering (Logic Circuits) (Karnaugh Map)
Digital Fundamentals with PLD Programming Floyd Chapter 4
Computer Programming Skills Revision Prepared by: Ghader Kurdi.
Chapter 5 Boolean Algebra and Reduction Techniques William Kleitz Digital Electronics with VHDL, Quartus® II Version Copyright ©2006 by Pearson Education,
Overview Part 2 – Circuit Optimization 2-4 Two-Level Optimization
Boolean Algebra and Logic Simplification
Digital Logic and Design Vishal Jethva Lecture No. 10 svbitec.wordpress.com.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals with PLD Programming.
EEE324 Digital Electronics Ian McCrumRoom 5B18, Lecture 4: Boolean Algebra.
Systems Architecture I1 Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they.
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
Department of Computer Engineering
Chapter 10 (Part 2): Boolean Algebra  Logic Gates (10.3) (cont.)  Minimization of Circuits (10.4)
1 Digital Logic Design Week 5 Simplifying logic expressions.
Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.
Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.
Chapter 3: Digital Logic Dr Mohamed Menacer Taibah University
Digital Systems: Combinational Logic Circuits Wen-Hung Liao, Ph.D.
Figure 4–1 Application of commutative law of addition. Thomas L. Floyd Digital Fundamentals, 9e Copyright ©2006 by Pearson Education, Inc. Upper Saddle.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 3.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Pp244 In Sum-of-Products (SOP) form, basic.
Boolean Algebra and Reduction Techniques
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
Chapter 2 Boolean Algebra and Minimization Techniques.
Boolean Expressions Lecture 3 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.
DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor
Karnaugh Maps (K-Maps)
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Binary Numbers For digital systems, the.
Chapter 4 OPTIMIZED IMPLEMENTATION OF LOGIC FUNCTIONS.
ENGG 340 Midterm Review. Introduced the Concept of Variables and Functions Introduced the Concept of AND, OR, and NOT Introduced the Concept of Truth.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Lecture 21: Combinatorial Circuits II Discrete Mathematical Structures: Theory and Applications.
K-maps and Decoders Prof. Sin-Min Lee Department of Computer Science.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Mu.com.lec 9. Overview Gates, latches, memories and other logic components are used to design computer systems and their subsystems Good understanding.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Combinational Circuits Part 1
Digital Fundamentals Floyd Chapter 5 Tenth Edition
ECE 2110: Introduction to Digital Systems
ECE 3110: Introduction to Digital Systems
Boolean Algebra and Combinational Logic
Digital Fundamentals Floyd Chapter 5 Tenth Edition
BASIC & COMBINATIONAL LOGIC CIRCUIT
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 4 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Karnaugh Maps (K maps).
Chapter 5 Combinational Logic Analysis
Analysis of Logic Circuits Example 1
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Combinational Logic Circuit
Laws & Rules of Boolean Algebra
Presentation transcript:

Chapter 5 Boolean Algebra and Reduction Techniques 1

5-9 Karnaugh Mapping Used to minimize the number of gates –Reduce circuit cost –Reduce physical size –Reduce gate failures –Requires SOP form Karnaugh Mapping –Graphically shows output level for all possible input combinations – Moving from one cell to an adjacent cell, only one variable changes 31 2

Karnaugh Mapping Steps for K-map reduction: 1.Transform the Boolean equation into SOP form 2.Fill in the appropriate cells of the K-map 3.Encircle adjacent cells in groups of 2, 4 or 8 1.Adjacent means a side is touching, NOT diagonal. 2.Watch for the wraparound 4.Find each term of the final SOP equation by determining which variables remain the same within circles 33 3

Figure 5.86 Two-, three-, and four-variable Karnaugh maps. 4

5

Figure 5.88 Encircling adjacent cells in a Karnaugh map. 6

7

8

9

10

11

12

13

Discussion Point Use a K-map to simplify the circuit. 14

5-10 System Design Applications Use Karnaugh Mapping to reduce equations Use AND-OR-INVERT gates to implement logic 15

16

Figure 5.96 (a) Simplified equation derived from a Karnaugh map; (b) implementation of the odd-number decoder using an AOI. 17

Summary Several logic gates can be connected together to form combinational logic. There are several Boolean laws and rules that provide the means to form equivalent circuits. Boolean algebra is used to reduce logic circuits to simpler equivalent circuits that function identically to the original circuit. 18

Summary DeMorgan’s theorem is required in the reduction process whenever inversion bars cover more than one variable in the original Boolean equation. NAND and NOR gates are sometimes referred to as universal gates, because they can be used to form any of the other gates. 19

Summary AND-OR-INVERT (AOI) gates are often used to implement sum-of-products (SOP) equations. Karnaugh mapping provides a systematic method of reducing logic circuits. Combinational logic designs can be entered into a computer using schematic block design software or VHDL. 20

Summary Using vectors in VHDL is a convenient way to group like signals together similar to an array. Truth tables can be implemented in VHDL using vector signals with the selected signal assignment statement. Quartus II can be used to determine the simplified equation of combinational circuits. 21