topics Logic gates Gates types Universal gates

Slides:



Advertisements
Similar presentations
Date of Birth Design Problem
Advertisements

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.
ENGIN112 L7: More Logic Functions September 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 7 More Logic Functions: NAND, NOR,
Other Gate Types Why? Gate classifications
Logic Gates.
Announcements mid-term on Thursday 12:30 – be on time. Calculators allowed (required!) No assignment due this week Assignment 6 posted on Thursday Project.
Digital logic gates.
Department of Computer and Information Science, School of Science, IUPUI CSCI 240 Digital Logic.
Logic Gates.
CT455: Computer Organization Logic gate
Digital Logic & Design Dr. Waseem Ikram Lecture 06
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
CHAPTER 2 LOGIC GATES.
Logic Gates.
Other Gate Types COE 202 Digital Logic Design Dr. Aiman El-Maleh
Programming Logic Gate Functions in PLCs
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.
Module 3 Combinational and Sequential Logic Circuit By: Cesar Mendoza.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 3.
01 Introduction to Digital Logic
CS 121 Digital Logic Design
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.
Lecture 8 Topics –Switch –Transistor –CMOS transistor –Logic gates AND, OR, NOT Universal gates: NAND, NOR XOR.
UNIT-8 LOGIC GATES.
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
LOGIC GATES Logic generally has only 2 states, ON or OFF, represented by 1 or 0. Logic gates react to inputs in certain ways. Symbol for AND gate INPUT.
NOCTI Review Lesson 4 Objectives:
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 WEEK #7 COMBINATIONAL LOGIC ANALYSIS.
LOGIC GATES & TRUTH TABLE – Digital Circuit 1 Choopan Rattanapoka.
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.
Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Exclusive OR Gate. Logically, the exclusive OR (XOR) operation can be seen as either of the following operations:exclusive OR (XOR) 1. A AND NOT B OR.
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.
Basic logic gates  AND gate:The truth table is given by A.BBA
Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.
Primitive Logic Functions Kuliah Sistem Digital, Teknik Elektro UMY (Rahmat Adiprasetya)
Combinational Logic: Other Gate Types
Combinational Logic Logic gates. and, or, not Derived gates. nand, nor, xor John F. Wakerly – Digital Design. 4 th edition. Chapter 4.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
Chapter 33 Basic Logic Gates. Objectives After completing this chapter, you will be able to: –Identify and explain the function of the basic logic gates.
Boolean Algebra & Logic Gates
Dr. Ameria Eldosoky Discrete mathematics
Eng. Mai Z. Alyazji October, 2016
Combinational Logic Logic gates. and, or, not Derived gates.
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
Exclusive OR Gate.
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Digital Signals Digital Signals have two basic states:
Basic Digital Logic Basic Gates
King Fahd University of Petroleum and Minerals
Logic Gates.
Discrete Mathematics CS 2610
Logic Gates.
KS4 Electricity – Electronic systems
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
GCSE Computer Science – Logic Gates & Boolean Expressions
Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.
Logic Gates.
Department of Electronics
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Basic Logic Operations
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

topics Logic gates Gates types Universal gates Realization of logic using gates

Combinational circuit Combinatorial Circuits are circuits which can be considered to have the following generic structure Whenever the same set of inputs is fed in to a combinatorial circuit, the same outputs will be generated.. Some simple combinational logic elements are "Gates".

Logic gates A logic gate is an electronic circuit/device which makes the logical decisions Logic gates have one or more inputs and only one output. the most common logic gates used are OR, AND, NOT, NAND, and NOR gates. The NAND and NOR gates are called universal gates.

Logic gates type

AND Gate The AND gate performs logical multiplication, commonly known as AND function. The AND gate has two or more inputs and single output. The output of AND gate is HIGH only when all its inputs are HIGH (i.e. even if one input is LOW, Output will be LOW). X Y F=X.Y 1 Truth table

OR Gate The OR gate performs logical addition, commonly known as OR function. The OR gate has two or more inputs and single output. The output of OR gate is HIGH only when any one of its inputs are HIGH (i.e. even if one input is HIGH, Output will be HIGH). X Y F=X+Y 1

NOT Gate The NOT gate performs the basic logical function called inversion or complementation. NOT gate is also called inverter. The purpose of this gate is to convert one logic level into the opposite logic level. It has one input and one output. When a HIGH level is applied to an inverter, a LOW level appears on its output and vice versa. X F=X’ 1

BUFFER GATE Buffer or BUF is also a gate with the exception that it does not perform any logical operation on its input. Buffers just pass input to output. Buffers are used to increase the drive strength or sometime just to introduce delay. X F=X 1

NAND GATE NAND gate is a cascade of AND gate and NOT gate, as shown in the figure below. It has two or more inputs and only one output. The output of NAND gate is HIGH when any one of its input is LOW X Y F=(X.Y)’ 1

NOR GATE NOR gate is a cascade of OR gate and NOT gate, as shown in the figure below. It has two or more inputs and only one output. The output of NOR gate is HIGH when any all its inputs are LOW X Y F=(X+Y)’ 1

XOR GATE If X and Y are two inputs, then output F can be represented mathematically as F = XY, Here denotes the XOR operation. XY and is equivalent to X.Y' + X'.Y. Truth table and symbol of the XOR gate is shown in the figure below. X Y F=X.Y’+X’.Y 1

XNOR GATE (equivalence gate) If X and Y are two inputs, then output F can be represented mathematically as F = XY, Here denotes the XNOR operation. XY and is equivalent to X.Y + X'.Y'. Truth table and symbol of the XNOR gate is shown in the figure below. X Y F=X’.Y’+X.Y 1

UNIVERSAL GATES Universal gates are the ones which can be used for implementing any gate like AND, OR and NOT, or any combination of these basic gates; NAND and NOR gates are universal gates. Nand gate Nor gate

XNOR GATE If X and Y are two inputs, then output F can be represented mathematically as F = XY, Here denotes the XNOR operation. XY and is equivalent to X.Y + X'.Y'. Truth table and symbol of the XNOR gate is shown in the figure below.     X Y F=(X.Y)’ 1