Circuit Simplification: Boolean Algebra

Slides:



Advertisements
Similar presentations
D IGITAL L OGIC Number Systems By: Safwan Mawlood Digital Principles and Logic Design, A.Saha &N.Manna.
Advertisements

Boolean Algebra and Reduction Techniques
Circuit Simplification: Boolean Algebra
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Chapter 5 Boolean Algebra and Reduction Techniques William Kleitz Digital Electronics with VHDL, Quartus® II Version Copyright ©2006 by Pearson Education,
EXAMPLE 5 Simplify a mathematical model Digital Photo Printing You send 15 digital images to a printing service that charges $. 80 per print in large format.
Digital Logic Design ESGD2201
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
Boolean Algebra and Logic Simplification
DeMorgan Theorem, Computer Simulation Exercises
1 Section 10.2 Boolean Algebra Motivation: Notice the list of corresponding properties for the algebra of sets and the algebra of propositional wffs. These.
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
Binary Logic Section 1.9. Binary Logic Binary logic deals with variables that take on discrete values (e.g. 1, 0) and with operations that assume logical.
DeMorgan’s Theorems Digital Electronics. DeMorgan’s Theorems DeMorgan’s Theorems are two additional simplification techniques that can be used to simplify.
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
Boolean Algebra ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
DIGITAL ELECTRONICS. Everything in digital world is based on binary system. Numerically it involves only two symbols 0 or 1. –0 = False = No –1 = True.
Binary Number System And Conversion
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Universal Gate – NAND Universal Gate - NAND Digital Electronics
ECE 301 – Digital Electronics
Truth Tables & Logic Expressions
The Binary Number System and Conversions
Universal Gate – NAND Universal Gate - NAND Digital Electronics
EXAMPLE 5 Simplify a mathematical model Digital Photo Printing
CHAPTER 2 Boolean Algebra
CHAPTER 1 : INTRODUCTION
Binary Number System And Conversion
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Binary Number System And Conversion
FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA
Jeremy R. Johnson Wed. Sept. 29, 1999
XOR, XNOR, and Binary Adders
Aberdeen Grammar School
Binary Number System And Conversion
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
The Binary Number System and Conversions
Date of Birth Design Problem
Combinational Logic Design Process
Boolean Algebra Digital Electronics
Karnaugh Mapping Karnaugh Mapping Digital Electronics
XOR, XNOR, & Binary Adders
Karnaugh Mapping Digital Electronics
AOI Design: Logic Analysis
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Binary Number System And Conversion
Karnaugh Mapping Karnaugh Mapping Digital Electronics
Date of Birth Design Problem
Circuit Simplification: DeMorgan’s Theorems
Boolean Algebra.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
COMP541 Combinational Logic - II
AOI Logic Implementation
Universal Gate – NOR Universal Gate - NOR Digital Electronics
AOI Design: Logic Analysis
XOR, XNOR, and Binary Adders
AOI Design: Logic Analysis
Circuit to Truth Table to Logic Expression
Circuit Simplification: DeMorgan’s Theorems
XOR, XNOR, and Binary Adders
Truth Tables & Logic Expressions
Laws & Rules of Boolean Algebra
Circuit Simplification: DeMorgan’s Theorems
Binary Number System And Conversion
Binary Number System And Conversion
Boolean Algebra S.SADHISH PRABHU.
Presentation transcript:

Circuit Simplification: Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Circuit Simplification: Boolean Algebra Digital Electronics © 2014 Project Lead The Way, Inc. Project Lead The Way, Inc. Copyright 2009

What is Boolean Algebra ? Digital Electronics ™ 2,1 Introduction to AOI Logic Boolean Algebra is a mathematical technique that provides the ability to algebraically simplify logic expressions. These simplified expressions will result in a logic circuit that is equivalent to the original circuit, yet requires fewer gates. Introductory Slide / Overview of Presentation Simplification With Boolean Algebra Project Lead The Way, Inc. Copyright 2009

Boolean Algebra George Boole Digital Electronics ™ 2,1 Introduction to AOI Logic My name is George Boole and I lived in England in the 19th century. My work on mathematical logic, algebra, and the binary number system has had a unique influence upon the development of computers. Boolean Algebra is named after me. A little history… http://www.math.uconn.edu/MathLinks/mathematicians_gallery.php?Rendition=printerfriendly Project Lead The Way, Inc. Copyright 2009

Boolean Theorems (1 of 7) Single Variable - AND Function Theorem #1 Boolean Algebra Boolean Theorems (1 of 7) Digital Electronics ™ 2,1 Introduction to AOI Logic Single Variable - AND Function Theorem #1 Theorem #2 Theorem #3 Theorem #4 X X 1 X X X Y Z 1 X Y Z 1 X Y Z 1 X Y Z 1 Basic AND Boolean Theorems Project Lead The Way, Inc. Copyright 2009

Boolean Theorems (2 of 7) Single Variable - OR Function Theorem #5 Boolean Algebra Boolean Theorems (2 of 7) Digital Electronics ™ 2,1 Introduction to AOI Logic Single Variable - OR Function Theorem #5 Theorem #6 Theorem #7 Theorem #8 X X 1 X X 1 X Y Z 1 X Y Z 1 X Y Z 1 X Y Z 1 Basic OR Boolean Theorems Project Lead The Way, Inc. Copyright 2009

Boolean Theorems (3 of 7) Single Variable - Invert Function Theorem #9 Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Single Variable - Invert Function Theorem #9 Basic INVERTER Boolean Theorems 1 Project Lead The Way, Inc. Copyright 2009

Example #1: Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Example Simplify the following Boolean expression and note the Boolean theorem used at each step. Put the answer in SOP form. Pause the presentation and allow students to complete the example. The solution is on the next slide. Project Lead The Way, Inc. Copyright 2009

Example #1: Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Example Simplify the following Boolean expression and note the Boolean theorem used at each step. Put the answer in SOP form. Solution This slide includes the solution to example #1. If you print handouts, do not print this page. ; Theorem #3 ; Theorem #4 ; Theorem #1 ; Theorem #5 Project Lead The Way, Inc. Copyright 2009

Example #2: Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Example Simplify the following Boolean expression and note the Boolean theorem used at each step. Put the answer in SOP form. Pause the presentation and allow the student to complete the example. The solution is on the next slide. Project Lead The Way, Inc. Copyright 2009

Example #2: Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Example Simplify the following Boolean expression and note the Boolean theorem used at each step. Put the answer in SOP form. Solution ; Theorem #3 (twice) ; Theorem #7 ; Theorem #2 ; Theorem #1 ; Theorem #5 This slide includes the solution to example #2. If you print handouts, do not print this page. Project Lead The Way, Inc. Copyright 2009

Boolean Theorems (4 of 7) Commutative Law Theorem #11 – AND Function Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Commutative Law Theorem #11 – AND Function Theorem #12 – OR Function Commutative Law Project Lead The Way, Inc. Copyright 2009

Boolean Theorems (5 of 7) Associative Law Theorem #13– AND Function Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Associative Law Theorem #13– AND Function Theorem #14 – OR Function Associative Law Project Lead The Way, Inc. Copyright 2009

Boolean Theorems (6 of 7) Distributive Law Theorem #15 – AND Function Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Distributive Law Theorem #15 – AND Function Theorem #16 – OR Function Distributive Law Project Lead The Way, Inc. Copyright 2009

Example #3: Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Example Simplify the following Boolean expression and note the Boolean theorem used at each step. Put the answer in SOP form. Pause the presentation and allow students to complete the example. The solution is on the next slide. Project Lead The Way, Inc. Copyright 2009 14

Example #3: Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Example Simplify the following Boolean expression and note the Boolean theorem used at each step. Put the answer in SOP form. Solution ; Theorem #15 ; Theorem #4 ; Theorem #5 ; Theorem #14 ; Theorem #8 ; Theorem #6 ; Theorem #2 This slide includes a solution for example #3. If you print handouts, do not print this page. Project Lead The Way, Inc. Copyright 2009 15

Boolean Theorems (7 of 7) Consensus Theorem Theorem #16 Theorem #18 Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Consensus Theorem Theorem #16 Theorem #18 Theorem #17 Theorem #19 Project Lead The Way, Inc. Copyright 2009

Example #4: Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Example Simplify the following Boolean expression and note the Boolean theorem used at each step. Put the answer in SOP form. Pause the presentation and allow students to complete the example. The solution is on the next slide. Project Lead The Way, Inc. Copyright 2009 17

Example #4: Boolean Algebra Digital Electronics ™ 2,1 Introduction to AOI Logic Example Simplify the following Boolean expression and note the Boolean theorem used at each step. Put the answer in SOP form. Solution ; Theorem #14 ; Theorem #18 ; Theorem #6 ; Theorem #2 This slide includes a solution to example #4. If you print handouts, do not print this page. Project Lead The Way, Inc. Copyright 2009 18

Summary Boolean Theorems Commutative Law Associative Law Boolean Algebra Summary Digital Electronics ™ 2,1 Introduction to AOI Logic Boolean Theorems Commutative Law Associative Law Distributive Law Print this page so that students can use it as a reference guide. Consensus Theorem Project Lead The Way, Inc. Copyright 2009