UNIVERSAL GATES.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Logic Gates.
التصميم المنطقي Second Course
Boolean Algebra and Combinational Logic
Multiplexer as a Universal Function Generator
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 3. Boolean Algebra, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Combinational Logic Design CS341 Digital Logic and Computer Organization F2003.
CPS120: Introduction to Computer Science
Logic Gates. Outline  Logic Gates  The Inverter  The AND Gate  The OR Gate  The NAND Gate  The NOR Gate  The XOR Gate  The XNOR Gate  Drawing.
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.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
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. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design.
Module 7.  In Module 3 we have learned about NAND gate – it is a combination of AND operation followed by NOT operation  Symbol A. B = Y  Logic Gate.
CHAPTER 5 Combinational Logic Analysis
ECE DIGITAL LOGIC LECTURE 5: BINARY LOGIC AND DIGITAL LOGIC GATES Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 01/28/2016.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
Mu.com.lec 9. Overview Gates, latches, memories and other logic components are used to design computer systems and their subsystems Good understanding.
Digital Logic Design Ch1-1. Digital Logic Design Ch1-2 Introduction to digital logic (logic gates, flip-flops, circuits) Definition of Digital Logic 
LOGIC GATES. INTRODUCTION TO LOGIC GATES Boolean functions may be practically implemented by using electronic gates. The following points are important.
Basics of Logic gates - Part 1
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Digital Logic.
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Dr.Ahmed Bayoumi Dr.Shady Elmashad
CHAPTER 3 Simplification of Boolean Functions
Logic Gates.
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
EI205 Lecture 5 Dianguang Ma Fall 2008.
Exclusive OR Gate.
Boolean Algebra and Combinational Logic
Lecture 2-1 Boolean Algebra
Computer Architecture CST 250
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Digital Signals Digital Signals have two basic states:
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Boolean Algebra Why study Boolean Algebra?
Boolean Algebra & Logic Circuits
Digital Logic & Design Dr. Waseem Ikram Lecture 13.
Circuits, Truth Tables & Boolean Algebra
Universal gates.
Universal Gate – NAND Universal Gate - NAND Digital Electronics
King Fahd University of Petroleum and Minerals
JC Technology Logic Gates.
Logic Gates.
Logic Gates.
KS4 Electricity – Electronic systems
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Chapter 10.3 and 10.4: Combinatorial Circuits
Chapter 4 Gates and Circuits.
Circuits, Truth Tables & Boolean Algebra
ECE 352 Digital System Fundamentals
Department of Electronics
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Logic Gates AIM: To know the different types of logic gate
Boolean Algebra and Gate Networks
ECE 352 Digital System Fundamentals
Logic Gates By: Asst Lec. Besma Nazar Nadhem
Circuit Simplification and
Course Title : Digital Electronics -1 Course No.: 6841 Course Teacher:Engr: Suvadra Chowdhury Chief Instructor Chittagong Mohila –Polytechnic Institute.
Presentation transcript:

UNIVERSAL GATES

Objectives What are gates? Fundamental gates. Universal gates - NAND and NOR. How to implement NOT, AND, and OR gates using NAND gates only. How to implement NOT, AND, and OR gates using NOR gates only. Equivalent gates. Two-level digital circuit implementations using universal gates only. Applications

What is a gate? Combination of transistors(circuit) that takes one or more inputs and generates an output. So called because one logic state enables or “gates” another logic state. For each gate, the symbol, the truth table, and the formula are shown.

NOT Gate A NOT gate accepts one input value and produces one output value

AND Gate An AND gate accepts two input signals If the two input values for an AND gate are both 1, the output is 1; otherwise, the output is 0

OR Gate If the two input values are both 0, the output value is 0; otherwise, the output is 1

Universal Gates A universal gate is a gate which can implement any Boolean function without using any other gate type. The NAND and NOR gates are universal gates. In practice, this is advantageous since NAND and NOR gates are economical and easier to fabricate and are the basic gates used in all IC digital logic families. In fact, an AND gate is typically implemented as a NAND gate followed by an inverter, not the other way around!!  Likewise, an OR gate is typically implemented as a NOR gate followed by an inverter, not the other way around!! 

NAND and NOR Gates The NAND and NOR gates are essentially the opposite of the AND and OR gates, respectively

Link inputs B & C together (to a same source). Universal Gates How to use NAND gates to build a NOT gate? Truth Table A Q C B A B C Q 1 Hint! Link inputs B & C together (to a same source). When A = 0, B = C = 0 When A = 1, B = C = 1

Universal Gates How to use NAND gates to build an AND gate? Truth Table A B C Q 1 NAND NOT A C Q B Hint 1 : Use 2 NAND gates Hint 2 : From a NAND gate, build a NOT gate Hint 3 : Put this “NOT” gate after the NAND gate

Hint 2 : Use 2 NAND gates to build 2 NOT gates Universal Gates How to use NAND gates to build an OR gate? Truth Table A B C D Q A B C D Q 1 Hint 1 : Use 3 NAND gates Hint 2 : Use 2 NAND gates to build 2 NOT gates Hint 3 : Put the 3rd NAND gate after the 2 “NOT” gates

Link inputs B & C together (to a same source). Universal Gates How to use NOR gate to build a NOT gate? Truth Table A B C Q 1 A Q B C Hint! Link inputs B & C together (to a same source). When A = 0, B = C = 0 When A = 1, B = C = 1

Universal Gates How to use NOR gates to build an OR gate? A B C D E Q Truth Table A B C D E Q 1 NOR NOT A D C Q B E Hint 1 : Use 2 NOR gates Hint 2 : From a NOR gate, build a NOT gate Hint 3 : Put this “NOT” gate after a NOR gate

Hint 2 : From 2 NOR gates, build 2 NOT gates Universal Gates How to use NOR gates to build an AND gate? Truth Table A B C D Q 1 A B C D Q Hint 1 : Use 3 NOR gates Hint 2 : From 2 NOR gates, build 2 NOT gates Hint 3 : Each “NOT” gate is an input to the 3rd NOR gate

Hint 2 : Use 3 NAND gates to build an OR gate Universal Gates How to use NAND gates to build a NOR gate? Truth Table A B C D Q E A B C D E Q 1 Hint 1 : Use 4 NAND gates Hint 2 : Use 3 NAND gates to build an OR gate Hint 3 : Use a NOR gate to build a NOT gate Hint 4 : Put the “NOT” gate after “OR” gate

Universal Gates How to use NOR gates to build a NAND gate? A B C D E Q Truth Table A B C D E Q 1 Hint 1 : Use 4 NOR gates Hint 2 : Use 3 NOR gates to build a NAND gate Hint 3 : Use the 4th NOR gate to build a NOT gate Hint 4 : Insert “NOT” gate after “NAND” gate

Equivalent Gates A NAND gate is equivalent to an inverted-input OR gate. A NOR gate is equivalent to an inverted-input AND gate.

Two-Level Implementations Boolean functions in either SOP or POS forms can be implemented using 2-Level implementations. For SOP forms AND gates will be in the first level and a single OR gate will be in the second level. For POS forms OR gates will be in the first level and a single AND gate will be in the second level. Using inverters to complement input variables is not counted as a level. SOP forms can be implemented using only NAND gates, while POS forms can be implemented using only NOR gates.

Example 1: Implement the following SOP function F = XZ + Y’Z + X’YZ

Example 2: Implement the following POS function  F = (X+Z) (Y’+Z) (X’+Y+Z)

Applications: Used in manufacturing logic circuits(devices such as multiplexers, registers, ALUs. Flash memory

Questions?? Why are NAND and NOR called universal gates? How many NAND gates make an AND gate? How many NOR gates make an OR gate? An inverted input OR gate is a ……………... Gate. POS forms can be implemented using ………. Gates.

THANK YOU