Basic Gates 1.1 Basic Digital Logic: AND, OR and NOT gates ©Paul Godin Created August 2007 Last Update Sept 2013.

Slides:

Advertisements

Similar presentations

Advertisements

Digital logic gates.

Computer Science 210 Computer Organization Introduction to Logic Circuits.

Programmable Logic Controllers.

Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:

Computer Systems – Logic Gates Introduce the basic logic gates Introduce truth tables Introduce Boolean algebra (dont panic!) Examples of combining gates.

Basic Logic Gate Sayed Mahbub Hasan Amiri Dhaka Residential Model College.

1 Computer Programming Boolean Logic Copyright © Texas Education Agency, 2013.

EXPLAIN THE LOGIC OPERATION APPLYING BASIC DIGITAL ENGINEERING By Sri Wahyuni, S.Pd.

Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.

Boolean Algebra and Truth Table The mathematics associated with binary number system (or logic) is call Boolean: –“0” and “1”, or “False” and “True” –Calculation.

Lab 04 :Serial Data Control Systems : Slide 2 Slide 3 Slide 4 NOR Gate: NAND Gate: NOR / NAND Alternate Symbols: Slide 5 XOR and XNOR Gate: Serial Data.

In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.

Logic Gates Circuits to manipulate 0’s and 1’s. 0’s and 1’s used for numbers Also to make decisions within the computer. In that context, 1 corresponds.

Simple One and Two Input Logic Gates Truth Tables and Function Tables Based Upon TTL Levels.

Logic Gate A logic gate is an electronic circuit which makes logic decisions. It has one output and one or more inputs. The output signal appears only.

Digital Systems Presented by Prof Tim Johnson

Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,

Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:

XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.

Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.

Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.

 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.

Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.

Basic Digital Logic 2 Combinational Logic

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.

Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.

Basic Gates 3.1 Basic Digital Logic: NAND and NOR Gates ©Paul Godin Created September 2007 Last Update Sept 2009.

Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.

Basic Digital Logic: NAND and NOR Gates Technician Series ©Paul Godin Last Update Dec 2014.

Multiplexers and De-Multiplexers 1

Steering Gates, Timing Diagrams & Combinational Logic Technician Series Steering 1.1 ©Paul Godin Created Jan 2014.

Basic Gates 2.1 Basic Digital Logic: Application of Digital Gates using AND / OR / NOT ©Paul Godin Created August 2007 Last Update Sept 2013 Basic Gates.

Logic Gates. A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment,

Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.

Logic Simplification-Using Boolean Laws Logic Design Laboratory EE 2121 Lectures By Manesh T EE2121-In Charge

Digital logic representation In digital logic system,events are described as either 0 or 1 Two logic states 1= logic High 0 = logic Low.

Minute Paper 4/4/04 Z=50+j86.7=100

PHYSICS – Digital electronics. LEARNING OBJECTIVES Core Supplement Explain and use the terms analogue and digital in terms of continuous variation and.

Author : Khairi LOGIC GATES Logic gate Input Output  Logic gates are electronic switches with one or more input but only one output ogic gates are commonly.

Logic Gates and Boolean Algebra

Logic Gates and Boolean Algebra

Logic Gates Benchmark Companies Inc PO Box Aurora CO

Basic Digital Logic.

KS4 Electricity – Electronic systems

KS4 Electricity – Electronic systems

Digital Signals Digital Signals have two basic states:

Basic Digital Logic Basic Gates

Jeremy R. Johnson Wed. Sept. 29, 1999

Practice #Digital Logic Mr. Burleson

Computer Science 210 Computer Organization

NATURE SUNDAY ACADEMY BOOLEAN ALGEBRA.

Latch Practice Problems 1

Basic Digital Logic: X-OR and X-NOR Gates

Boolean Logic 2 ©Paul Godin Created September 2007 Last edit Sept 2009

KS4 Electricity – Electronic systems

GCSE Computer Science – Logic Gates & Boolean Expressions

Basic Digital Logic: AND, OR and NOT gates Technician Series

Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.

Logically, the output will be 1

Introduction to Logic diagrams and truth tables

ECE 352 Digital System Fundamentals

Chapter 3 – Describing Logic Circuits

Introduction to Logic diagrams and truth tables

Agenda Lecture Content: Combinatorial Circuits Boolean Algebras

SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.

Presentation transcript:

Basic Gates 1.1 Basic Digital Logic: AND, OR and NOT gates ©Paul Godin Created August 2007 Last Update Sept 2013

Basic Gates 1.2 Digital Logic: Introduction ◊The foundation of digital systems is the ability to make logic-based decisions on input states. ◊Boolean Algebra is a relatively simple mathematic form based on logic functions comprising of two states: true (logic 1) or false (logic 0). It is used to describe output states based on a set of input states. ◊Boolean mathematics has been around for over a hundred years but much of it is well suited to digital systems. Boolean logic is used in internet search engines.

Basic Gates 1.3 Truth Tables Truth tables describe the function of a digital device. They show the output states based on input states. InputOutput Every possible input combination

Basic Gates 1.4 Basic Digital Logic Functions Digital logic is based on 3 primary functions (the Basic Gates): AND OR NOT

Basic Gates 1.5 The AND Operation AND All inputs must be True for the output to be True. ◊Other ways to describe AND: ◊If all inputs are 1 the output is 1 ◊If any input is 0, the output is 0 ◊“If this input AND this input are 1, the output is 1”

Basic Gates 1.6 AND Logic Symbol Inputs Output If all inputs are 1, the output is 1 If any input is 0, the output is 0

Basic Gates 1.7 AND Logic Symbol InputsOutput Determine the output 0 0

Basic Gates 1.8 AND Logic Symbol InputsOutput Determine the output 0 1

Basic Gates 1.9 AND Logic Symbol InputsOutput Determine the output 1 1

Basic Gates 1.10 AND Truth Table InputOutput AND

Basic Gates 1.11 AND Gates It is possible to have AND gates with more than 2 inputs. The same logic rule applies – all inputs must be 1 for the output to be 1.

Basic Gates 1.12 AND Gates ◊IEEE symbol for an AND gate ◊Boolean equations for an AND gate: A●B = x AB = x & The AND operation operates similarly to multiplication.

Basic Gates 1.13 The OR Operation OR If any input is True, the output is True Other ways to describe OR: ◊if any input is 1, the output is 1 ◊if all inputs are 0, the output is 0 ◊“If this input OR this input is 1, the output is 1”

Basic Gates 1.14 OR Logic Symbol Inputs Output If any input is 1, the output is 1 If all inputs are 0, the output is 0

Basic Gates 1.15 OR Logic Symbol InputsOutput Determine the output 0 0

Basic Gates 1.16 OR Logic Symbol InputsOutput Determine the output 0 1

Basic Gates 1.17 OR Logic Symbol InputsOutput Determine the output 1 1

Basic Gates 1.18 OR Truth Table InputOutput OR

Basic Gates 1.19 OR Gates It is possible to have OR gates with more than 2 inputs. The same logic rule applies – If any input is 1, the output is 1.

Basic Gates 1.20 OR Gates ◊IEEE symbol for an OR gate ◊Boolean equation for an OR gate: A+B = x ≥1 The OR operation operates similarly to Addition.

Basic Gates 1.21 The NOT Operation NOT The output is the opposite state of the input. ◊Other ways to describe NOT: ◊If any input is 1, the output is 0 ◊If any input is 0, the output is 1 The NOT function is often called INVERTER or COMPLIMENTARY.

Basic Gates 1.22 NOT Logic Symbol Input Output If the input is 1, the output is 0 If the input is 0, the output is 1 Note: The “bubble” on the output is considered the NOT function.

Basic Gates 1.23 NOT Logic Symbol Input Output Determine the output 0

Basic Gates 1.24 NOT Logic Symbol Input Output Determine the output 1

Basic Gates 1.25 NOT Truth Table InputOutput NOT

Basic Gates 1.26 NOT Gates ◊IEEE symbol for a NOT gate: ◊Boolean for a NOT function: A = x (overbar symbol) A’ = x (prime symbol) 1 Note: The triangle symbol on the output is considered the NOT function

Basic Gates 1.27 Alternate Symbols ◊The NOT is the “bubble” on the gate. ◊Alternate symbols for the NOT gate: 1

Basic Gates 1.28 Review 1 ◊There are 3 basic gates: ◊AND, where all inputs must be high for a high output ◊OR, where any input must be high for a high output ◊NOT, where the output is the opposite (compliment) of the input

Basic Gates 1.29 Review 2 AND Logic Symbol OR Logic Symbol NOT (or Inverter) Logic Symbol

Basic Gates 1.30 Review 3 A ● B = Y AB = Y A + B = Y A = Y A’ = Y A AND B = Y A OR B = Y NOT A = Y

Basic Gates 1.31 Exercise 1 What is the outcome of the following:

Basic Gates 1.32 Exercise 2 Complete the sentences: ◊If all inputs of an OR gate are low, the output is_________ ◊If any input of an AND gate is low, the output is _________ ◊The output of a NOT gate is always the ___________ of the input.

Basic Gates 1.33 Exercise 3 Complete the tables InputOutput ≥1 InputOutput &

Basic Gates 1.34 Exercise 4 Draw the logic equivalent of the AND and the OR gates using switches.

Basic Gates 1.35 Exercise 5 A vehicle has 2 proximity sensors and one motor. When triggered, the sensors produce a logic 1. The motor goes forward with a logic 0 and stops with a logic 1. If both sensors sense an object, stop. If only one, or none of the sensors sense an object, go forward. Draw the sensors, motor and the logic needed. (Hint: do a truth table)

Basic Gates 1.36 End ©Paul R. Godin prgodin gmail.com