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, every.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Programming Logic Gate Functions in PLCs
Types of Logic Circuits
EXPLAIN THE LOGIC OPERATION APPLYING BASIC DIGITAL ENGINEERING By Sri Wahyuni, S.Pd.
Digital Logic Chapter 5 Presented by Prof Tim Johnson
Digital Logic Design CHAPTER 5 Sequential Logic. 2 Sequential Circuits Combinational circuits – The outputs are entirely dependent on the current inputs.
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.
UNIT-8 LOGIC GATES.
Objectives: Given input logice levels, state the output of an RS NAND and RS NOR. Given a clock signal, determine the PGT and NGT. Define “Edge Triggered”
Chapter 4 Gates and Circuits.
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
MR. KERINS Logic Gates- Electrical Engineering. LOGIC GATES Logic gates are primarily implemented using diodes or transistors acting as electronic switches,
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
Transistors and Logic Circuits. Transistor control voltage in voltage out control high allows current to flow -- switch is closed (on) control low stops.
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.
DeMorgan Theorem, Computer Simulation Exercises
1 DIGITAL ELECTRONICS. 2 OVERVIEW –electronic circuits capable of carrying out logical (boolean) and arithmetic operations on information stored as binary.
1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.
LOGIC GATES.
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.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
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.
WELCOME. LOGIC GATE WHAT WE ARE GOING TO LEARN? The Logic Gate. Analogue and Digital signal. Bit and Byte. Boolean Theorem. Description and Circuit analyses.
1 Ethics of Computing MONT 113G, Spring 2012 Session 1 Digital Circuits, binary Numbers Course webpage:
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
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,
Synchronous Sequential Logic A digital system has combinational logic as well as sequential logic. The latter includes storage elements. feedback path.
The inverter performs the Boolean NOT operation. When the input is LOW, the output is HIGH; when the input is HIGH, the output is LOW. The Inverter AX.
1’S COMPLEMENT REPRESENTATION 1’s complement of a number (binary) is obtained by changing all 1’s to 0 and all 0’s to 1. If one of these numbers is positive.
WORKING PRINCIPLE OF DIGITAL LOGIC
4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
LOGIC GATES. INTRODUCTION TO LOGIC GATES Boolean functions may be practically implemented by using electronic gates. The following points are important.
Computer Architecture & Operations I
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Logic Gates.
Transistors and Logic Circuits
Digital Technology.
מבנה מחשב תרגול 3.
Computer Organization
Logic Gates and Boolean Algebra
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Digital Signals Digital Signals have two basic states:
Basic Digital Logic Basic Gates
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Digital Logic Structures Logic gates & Boolean logic
Number Systems Decimal (base 10) { }
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Logic Gates.
JC Technology Logic Gates.
Boolean Algebra.
Logic Gates.
KS4 Electricity – Electronic systems
Universal Gate – NOR Universal Gate - NOR Digital Electronics
GCSE Computer Science – Logic Gates & Boolean Expressions
AWIM Series Lawndale High School Experiment 6 Dec, 2017
Logic Gates.
Binary Logic.
FLIP-FLOPS.
Flip-Flops.
Department of Electronics
Logic Gates AIM: To know the different types of logic gate
DIGITAL ELECTRONICS AND LOGIC GATES. ANALOG SIGNAL:- Analog signal is continuous time varying current or voltage signal.
Presentation transcript:

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, every terminal is in one of the two binary conditions low (0) or high (1) represented by different voltage levels The logic state of a terminal can, and generally does, change often, as the circuit processes data In most logic gates, the low state is approximately zero volts (0 V) while the high state is approximately five volts positive (+5 V).

Truth Tables A truth table shows how a logic circuit's output responds to various combinations of the inputs using logic 1 for true and logic 0 for false. All permutations of the inputs are listed on the left output of the circuit is listed on the right The desired output can be achieved by a combination of logic gates A truth table for two inputs is shown, but it can be extended to any number of inputs. The input columns are usually constructed in the order of binary counting with a number of bits equal to the number of inputs.

NOT Gate or Inverter The output of a not gate is always opposite to it's input An X with a vertical bar over it means 'NOT X' .

AND gate An AND gate always has one output, but it can have many inputs (at least 2). The output is high only when both inputs A and B are high.

Relay logic equivalent

OR gate As with the AND gate, the OR gate has one output and several inputs. X+Y is equivilent to X OR Y. The output is high when either or both of inputs A or B is high. Below we have pictured a 2-input OR gate.

Relay logic equivalent

NAND gates A NAND gate is equivalent to an AND gate followed by a NOT gate. Notice that the bar stretches over all of the expression, to say that the whole thing is negated The output is high when either of inputs A or B is high, or if neither is high. In other words, it is normally high, going low only if both A and B are high.

Relay logic equivalent

NOR gates A NOR gate is an OR gate followed by a not gate. Notice that the bar stretches over all of the expression, to say that the whole thing is negated The output is high only when neither A nor B is high. That is, it is normally high but any kind of non-zero input will take it low.

Relay logic equivalent

EXOR gates EXOR (or EXclusive OR) gives TRUE if either but not both inputs are TRUE Notice that the symbol for EXOR is + (as in OR) in a circle The output is high when either of inputs A or B is high, but not if both A and B are high.

Relay logic equivalent

Negative Logic Gates Each of the basic gates has a negative logic equivalent as shown. The equivalence is shown by the application of DeMorgan's theorem. It amounts to changing AND's to OR's or vice versa and inverting all inputs.

A practical operational way to look at DeMorgan's Theorem is that the inversion bar of an expression may be broken at any point and the operation at that point replaced by its opposite (i.e., AND replaced by OR or vice versa

Exercise 1 What is the truth table for this circuit?

What is the truth table for this circuit?

COFFEE MACHINE

FLIP FLOP

Setting the NAND Latch After being set to Q=1 by the low pulse at S (NAND gate function), the restored normal value S=1 is consistent with the Q=1 state, so it is stable. Another negative pulse on S gives which does not switch the flip-flop, so it ignores further input.

Resetting the NAND Latch

Nor Flip Flop