Circuits, Truth Tables & Boolean Algebra

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
Boolean Algebra and Reduction Techniques
Lecture 14 Today we will Learn how to implement mathematical logical functions using logic gate circuitry, using Sum-of-products formulation NAND-NAND.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
LOGIC GATES AND CIRCUITS Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gates.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 2.
Circuit Simplification Truth Table  Minimized Logic Gates.
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
Basic Gates 3.1 Basic Digital Logic: NAND and NOR Gates ©Paul Godin Created September 2007 Last Update Sept 2009.
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
Basic Digital Logic: NAND and NOR Gates Technician Series ©Paul Godin Last Update Dec 2014.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 5 © 2008 Pearson Education.
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
Designing Combinational Logic Circuits
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.
DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.
CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Logic Gates and Boolean Algebra Introduction to Logic II.
Circuits, Truth Tables & Boolean Algebra. Expressions Can describe circuits in terms of Boolean expression.
Digital Logic Design. Truth Table  Logic Circuit 1. Start with truth table 2. When your output is a 1, figure out the combination of inputs, ANDs, and.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Combinational Circuits Part 1
Eng. Mai Z. Alyazji October, 2016
Logic Gates and Boolean Algebra
De Morgan’s Theorem,.
Boolean Algebra & De Morgan's Theorems
Logic Gates and Boolean Algebra
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
CHAPTER 1 : INTRODUCTION
Boolean Algebra and Combinational Logic
Boolean Algebra.
Princess Sumaya University
Boolean Algebra – Part 1 ECEn 224.
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
TN 221: DIGITAL ELECTRONICS 1
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
ECE 331 – Digital System Design
Reading: Hambley Chapters
CSE 140 : Components and Design Techniques for Digital Systems
Computer Science 210 Computer Organization
Agenda – 2/12/18 Questions? Readings: CSI 4, P
BASIC & COMBINATIONAL LOGIC CIRCUIT
Combinational Logic Design Process
Circuits, Truth Tables & Boolean Algebra
Universal gates.
Logic Gates.
Digital Logic.
Boolean Algebra.
Logic Gates.
KS4 Electricity – Electronic systems
Digital Fundamentals Floyd Chapter 5 Tenth Edition
De Morgan’s laws presentation
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Department of Electronics
Combinational Logic Circuit
Boolean Algebra By: Asst Lec. Besma Nazar Nadhem
ECE 352 Digital System Fundamentals
Presentation transcript:

Circuits, Truth Tables & Boolean Algebra

Expressions Can describe circuits in terms of Boolean expression

Expressions Write Q as a function of A, B and C

Expressions Write Q as a function of A, B and C

Expressions Write Q as a function of A, B and C

Expressions Write Q as a function of A, B and C

Expressions Can represent a circuit's output with Boolean expression: AB + AC

Sum Of Products Can convert any truth table to expression Identify ways to get 1 output X = 1 if red OR green OR yellow

Sum Of Products Sum of Products : Individual terms are products Terms OR’d together X = A B + A B + AB

Multiple Inputs Each product shows EVERY input Either raw or inverted Ex: Each product has A or A B or B C or C

SOP Circuit Can build circuit from SOP expression: X = A B + A B + AB Inputs feed layer of AND gates Some inputs inverted first OR gate takes ANDs X = A B + A B + AB

Multiple Outputs Multiple outputs Each output separate function/circuit IN OUT A B X Y 1

Multiple Outputs Multiple outputs X = AB Each output separate function/circuit X = AB IN OUT A B X Y 1

Multiple Outputs Multiple outputs X = AB Y = AB + A B Each output separate function/circuit X = AB Y = AB + A B IN OUT A B X Y 1

Logisim Build simplified circuit from truth table… Window  Combinational Analysis Build truth table for circuit… Project  Analyze Circuit

Multiple Outputs Multiple outputs X = AB Y = AB + A B Each output separate function/circuit X = AB Y = AB + A B

SOP Circuit Fun Fact Can build circuit from SOP expression… … but can often do better…

Expressions AB + AC A(B + C) Fun Fact We can simplify Boolean expressions AB + AC A(B + C)

Fun Fact Simplification Thus we can simplify circuits AB + AC A(B + C)

Simplification Fun Fact May be able to simplify SOP X = A B + A B + AB = A B + A( B + B) = A B + A(1) = A B + A = B + A = A + B

Single Gate Logic Fun Fact Can make NOT, AND & OR with only NAND

Single Gate Logic Fun Fact Can build circuit from SOP expression: Any circuit can be build with NOT, AND & OR

Fun Fact Single Gate Logic Replace NOT with NAND

Single Gate Logic Fun Fact Put inversion bubbles out of AND & into OR 2 negations cancel out

Single Gate Logic Fun Fact Convert A + B + …. to AB... De Morgan's Theorem

Single Gate Logic Fun Fact Circuit built entirely with NAND Can do the same trick with NOR