NAND & NOR as Universal gates

Slides:

Advertisements

Similar presentations

Advertisements

Instructor Dr Sameh Abdulatif

CSIS 3510 Computer Organization and Architecture Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a.

Morgan Kaufmann Publishers

Boolean Algebra and Reduction Techniques

Boolean rules for simplification Dr. Ahmed Telba.

Logic Gate Level Part 2. Constructing Boolean expression from truth table First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result.

CS 151 Digital Systems Design Lecture 7 More Logic Functions: NAND, NOR, XOR.

How to build a digital gate. CMOS NAND Gate Several realization of NOT 1. This is how a NOT operation is often represented schematically. 2. Sometimes.

Boolean Algebra. Introduction 1854: Logical algebra was published by George Boole  known today as “Boolean Algebra” 1854: Logical algebra was published.

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.

DeMorgan Theorem, Computer Simulation Exercises

Company LOGO DKT 122/3 DIGITAL SYSTEM 1 WEEK #7 COMBINATIONAL LOGIC ANALYSIS.

Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.

Digital Systems: Boolean Algebra and Logic Gates

Digital Electronics Lecture 6 Combinational Logic Circuit Design.

Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.

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.

Using De’Morgan’s On of the most useful principles in boolean algebra is De’Morgan’s Theorem, which allows one to switch between ANDs and NORs and ORs.

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

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.

Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.

COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.

Chapter 4 Fundamentals of Computer Logic 1 Chapter 4: Fundamental of Computer Logic - IE337.

DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor

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

CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.

DeMorgan’s Theorem DeMorgan’s 2 nd Theorem The complement of a sum of variables is equal to the product of the complemented variables. A + B = A. B Applying.

CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.

Chapter 5 Boolean Algebra and Reduction Techniques 1.

Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.

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

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.

CSE 461. Binary Logic Binary logic consists of binary variables and logical operations. Variables are designated by letters such as A, B, C, x, y, z etc.

Hoda Roodaki Boolean Algebra Hoda Roodaki

Combinational Circuits Part 1

Universal Gate – NOR Universal Gate - NOR Digital Electronics

Draw input and output characteristic of a transistor in CB mode

Universal Gate – NAND Universal Gate - NAND Digital Electronics

Eng. Mai Z. Alyazji October, 2016

De Morgan’s Theorem,.

Boolean Algebra & De Morgan's Theorems

Logic Gates and Boolean Algebra

Universal Gate – NAND Universal Gate - NAND Digital Electronics

Logic Gates Benchmark Companies Inc PO Box Aurora CO

Exclusive OR Gate.

Boolean Algebra.

Boolean Algebra A Boolean algebra is a set B of values together with:

KS4 Electricity – Electronic systems

KS4 Electricity – Electronic systems

Universal Gate – NAND Universal Gate - NAND Digital Electronics

Universal Gate – NOR Universal Gate - NOR Digital Electronics

Boolean Algebra & Logic Circuits

Universal gates.

Universal Gate – NAND Universal Gate - NAND Digital Electronics

Boolean Algebra.

BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)

KS4 Electricity – Electronic systems

Universal Gate – NOR Universal Gate - NOR Digital Electronics

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.

Digital Fundamentals Floyd Chapter 5 Tenth Edition

Chapter 5 Combinational Logic Analysis

Department of Electronics

Combinational Logic Circuit

ECE 352 Digital System Fundamentals

Presentation transcript:

NAND & NOR as Universal gates By Sushma chopde

Objectives: 1. To understand what are universal gates 2. To know the construction of other gates using NAND & NOR gates

We can construct any other logic gate or circuit by using Combination of only NAND or NOR gates ,and therefore they are called universal gates. Lets see how to construct other gates using NAND gates first. NOT gate: We know that the Boolean equation of NAND gate is y= And Boolean equation for NOT gate is y=A̅ This can be written as y = =A̅ ( i.e by law (A*A)=A ) A Y=A̅ A y 0 1 1 0

Boolean equation for AND gate is y=A*B Starting with NAND gate eq. Y=(A*B)’ Take double complement of it i.e y=(A*B)’’=A*B And this gives us AND gate A B (A*B)’ y=(A*B)’’ =A*B A B Y 1

OR gate: OR gate is given by y=A+B Using double complement law y’’=(A+B)’’ Will not change the equation Thus y= (A̅ *B̅)’ using Demorgan’s theorem and now this can be implemented using NAND gates only as shown below. A A̅ y=(A̅.B̅)’=A+B B B̅

Truth table for OR gate . A B Y 1

For making NOR gate just connect one more NAND Desired gate NOR For making NOR gate just connect one more NAND gate in the above figure as is shown in the following equation Y= Y= A̅ . B̅ Y’’ =( A̅ . B̅)’’

Ex-OR gate Eq. of EX-OR is y=A̅ .B + B̅ . A Take double complement of this equation which gives Y=(((A.B)’.B)’.((A.B)’.A)’)’

Ex-OR gate A Y B

Truth Table of Ex-OR gate Y 1

Lets try to construct other gates using NOR gates only NOT gate Equation for NOT gate is y=A̅ Therefore By OR law y= A Y A Y 1

OR gate OR gate eq. is Y=A+B Y= = (double complement law) A Y B A B Y 1

AND gate Eq.for AND gate is Y=A.B Y̅=A̅ + B̅ =(A̅ +B̅)’ A Y B A B Y 1

NAND gate NAND gate eq. is Y= Applying Demorgan’s law Y=A̅ +B̅ =(A̅ +B̅)’’

NAND gate A Y B A B Y 1

Ex-OR gate Now try to construct Ex-OR gate using NOR gates only using the same strategy which we have used in our discussion. Thank you