Group 5 – Maria Bozzi, Brian Surber, Sifat Syed and Can Gurkan.

Slides:



Advertisements
Similar presentations
Date of Birth Design Problem
Advertisements

Boolean Algebra Variables: only 2 values (0,1)
Inside the binary adder. Electro-mechanical relay A solid state relay is a switch that is controlled by a current. When current flows from A to B, the.
Logic Gate Objects This document contains various images created by Andrew C. M. Rodger, 4 October Tools used:LibreOffice Impress 3 Microsoft Powerpoint.
Lab 8 : Multiplexer and Demultiplexer Systems:
Group 1: Adrian Burke, Michael Pellegrini, Daniel Linderman, Colin Palmer, Markell Jones-Francis.
Princess Sumaya University
Introduction to CAFE Yu Hen Hu September 25, 2000.
Truth Tables & Logic Expressions
Truth Tables and Logic Gates. What are Logic Gates? Logic gates are components used in making logic circuits. Each gate has one or more inputs and produces.
Lab02 :Logic Gate Fundamentals:
Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.
Digital Systems: Logic Gates and Boolean Algebra Wen-Hung Liao, Ph.D.
ENGIN112 L7: More Logic Functions September 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 7 More Logic Functions: NAND, NOR,
Department of Computer and Information Science, School of Science, IUPUI CSCI 240 Digital Logic.
Digital Logic & Design Dr. Waseem Ikram Lecture 06
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
CS 151 Digital Systems Design Lecture 5 Boolean Algebra.
Logic Gates.
GCSE Computing#BristolMet Session Objectives#5 MUST explain why data is represented in computer systems in binary SHOULD understand and produce simple.
©2010 Akula LLC, Jeremy R. Hertzberg, BS CMPE Computer Technology Transistor to computer gates
Logic Circuits Situations to explain states What is a logic Gate
Logic Gates & Circuits. AND Gate Input AInput BOutput X AND Logic Gate AND Truth Table X = A. B AND Boolean Expression.
Chapter 3 Digital Logic Structures
topics Logic gates Gates types Universal gates
Computer Logic & Logic Gates Justin Champion. IITCT Contents Introduction to Logic Look at the different Logic Gates Summary.
01 Introduction to Digital Logic
Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems  We have seen three different, but equally powerful, notational methods for describing.
CS 121 Digital Logic Design
Princess Sumaya University
Node Optimization. Simplification Represent each node in two level form Use espresso to minimize each node Several simplification procedures which vary.
Min terms and logic expression
Digital Circuits.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
TOPIC : Truth tables and Primitive Cubes
PHY 201 (Blum)1 Karnaugh Maps References: Chapters 4 and 5 in Digital Principles (Tokheim) Chapter 3 in Introduction to Digital Systems (Palmer and Perlman)
Computer Science 101 Circuit Design Algorithm. Circuit Design - The Problem The problem is to design a circuit that accomplishes a specified task. The.
Karnaugh Maps By: Shakil Nobes.
Karnaugh Maps References:
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.
Computer Science 101 Circuit Design - Examples. Sum of Products Algorithm Identify each row of the output that has a 1. Identify each row of the output.
Circuit Simplification Truth Table  Minimized Logic Gates.
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
Brief Introduction to Boolean Algebra We can use transistors to build AND, OR, NAND, NOR, and Invertors Manufacturing is simplified with NAND/NOR NAND/NOR.
Designing Combinational Logic Circuits
Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
Circuits, Truth Tables & Boolean Algebra. Expressions Can describe circuits in terms of Boolean expression.
K-maps and Decoders Prof. Sin-Min Lee Department of Computer Science.
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.
Basics of Logic gates - Part 2
Logic Gates and Boolean Algebra
Computer Science 210 Computer Organization
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
Logic Gates.
The Relay based Multiplexer
Boolean Expressions Lecture No. 10.
Circuits & Boolean Expressions
How Boolean logic is implemented
Computer Science 210 Computer Organization
Karnaugh Maps References:
Karnaugh Maps References: Lecture 4 from last semester
Digital Circuits.
Circuits, Truth Tables & Boolean Algebra
Logic Gates.
Chapter - Karnaugh Maps
Circuits, Truth Tables & Boolean Algebra
Truth tables Mrs. Palmer.
Circuits & Boolean Expressions
Presentation transcript:

Group 5 – Maria Bozzi, Brian Surber, Sifat Syed and Can Gurkan

How Does it Work? It works with three sensors: the sight, the touch and the hearing It activates different lights or sounds an alarm if it sees or hears us, or if we touch it. The green light activates when these three sensors are off and when they don’t receive any input. The yellow light activates when one of these three sensors is stimulated. The red light means that two of three sensors are activated. The alarm rings when all of the three sensors are on.

How Did We Work? We started to do the design of the circuit and we found the solution thanks to the Boolean algebra TRUTH TABLE

How does the truth table works? Now we sum the numbers that bring us to our solution, for example if we need the 0 we don’t need any of these numbers and in the Boolean algebra we write 000, if we need for example the 4 we need the third column and nothing else so we write 100, if we need the 13 we sum the fourth, the third, and the first column and we get to the 13 and in the Boolean algebra we write 1101…

How can we apply the truth table to our circuit? Our truth table works only with two numbers, the one and the zero and in our circuits we need only the first three columns so we use the letter A, B, C. The zero corresponds to a normal A, B and C, and the one corresponds to the A ̅, B ̅, C ̅ ABC AB C̅C̅ A B̅B̅ C A B̅B̅ C̅C̅ A̅A̅ BC A̅A̅ B C̅C̅ A̅A̅ B̅B̅ C A̅A̅ B̅B̅ C̅C̅

How can we apply the truth table to our circuit? Now that we know the correspondence between the numbers and the letters we can build our circuit, but HOW? There are two important gates in the circuits that we have to consider firstly, the AND gate and the OR gate. An AND gate corresponds to a (*) An OR gate corresponds to a (+) Our ABC, or ABC ̅ corresponds to do A * B * C. So this means that between our three numbers there will be and gates. But what these letters – numbers represent?

How can we apply the truth table to our circuit? A,B and C represents our three sensors in our circuit. The one is representing the sensor that is ON, the 0 represents that the sensor is OFF and the bar on the letter represent that we have to use the invertor. So we can copy our truth table to understand the sensors and how they can work A̅A̅ B̅B̅ C̅C̅ ĀB̄C ĀBC̄ ĀBC AB̄C̄ AB̄C ABC̄ ABC

How can we apply the truth table to our circuit? So in conclusion we can tell that the first row corresponds to our green light, the second, the third and the fifth to our yellow light, the fourth, the sixth and the seventh to our red light and the last one to our alarm. So we put our and gates between the letters and or gates between the blocks of letter that we use for a LED and the invertors in the sensor of the bar.

Design of our circuit –yellow LED We have to put into the letters that represent the 001, the 010, and the 100 And gate Invertor YELLOW LED Or gate Battery Switches

Design of our circuit – red LED And gate Invertor RED LED Or gate Battery Switches We have to put the letters that represent the 011, the 101, and the 110

Here we put also the alarm and the green LED and we simplified the yellow one For the alarm we need the ABC, that is the 111 and for the green LED the ĀB̄C̄ that is the 000 We said to our circuit put the yellow light when the other lights are off

Then we applied our design to a real circuit

Now you can take a look at our project working!!!