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

Slides:



Advertisements
Similar presentations
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Advertisements

Logic Gates.
Logic Gates.
Programmable Logic Controllers.
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
Boolean Algebra and Reduction Techniques
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals with PLD Programming.
Basic Digital Logic 2 Combinational Logic
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Circuit Simplification Truth Table  Minimized Logic Gates.
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions
Logic Gates and Boolean Algebra Wen-Hung Liao, Ph.D. 11/2/2001.
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.
Boolean Logic 1 Technician Series Boolean 1.1 ©Paul Godin Created Jan 2015 gmail.com.
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.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 5 © 2008 Pearson Education.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Pp244 In Sum-of-Products (SOP) form, basic.
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions ECE 301 – Digital Electronics.
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
Basic Gates 1.1 Basic Digital Logic: AND, OR and NOT gates ©Paul Godin Created August 2007 Last Update Sept 2013.
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,
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.
DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
1 Ch.3 Logic Gates and Boolean Algebra – Part 1
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Combinational Circuits Part 1
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Logic Gates and Boolean Algebra
Chapter 3 Notes – Part II Review Questions
Logic Gates.
De Morgan’s Theorem,.
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Boolean Algebra & De Morgan's Theorems
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
ECE 331 – Digital System Design
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Circuits, Truth Tables & Boolean Algebra
Universal gates.
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Logic Gates.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
KS4 Electricity – Electronic systems
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Basic Digital Logic: AND, OR and NOT gates Technician Series
Circuits, Truth Tables & Boolean Algebra
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Chapter 5 Combinational Logic Analysis
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Combinational Logic Circuit
ECE 352 Digital System Fundamentals
Chapter 3 – Describing Logic Circuits
Presentation transcript:

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

The Universal Gates: NAND and NOR

Combinational logic ◊How would your describe the output of this combinational logic circuit? A B Z Basic Gates 2.3

NAND Gate ◊The NAND gate is the combination of an NOT gate with an AND gate. The Bubble in front of the gate is an inverter. A B Z Basic Gates 2.4

NAND Gate ◊IEEE Symbol ◊Boolean equations for the NAND gate: & A●B = x AB = x The triangle is the same as the bubble. Basic Gates 2.5

Combinational logic ◊How would your describe the output of this combinational logic circuit? B A Z Basic Gates 2.6

NOR gate ◊The NOR gate is the combination of the NOT gate with the OR gate. The Bubble in front of the gate is an inverter. B A Z Basic Gates 2.7

NOR Gate ◊IEEE Symbol for a NOR gate: ◊Boolean equation for a NOR gate: ≥1 A+B = x Basic Gates 2.8

Exercise 1 Complete the Truth Table for the NAND and NOR Gates InputOutput InputOutput NAND NOR Hint: Think of the AND and OR truth tables. The outputs for the NAND and NOR are inverted. Basic Gates 2.9

Exercise 2 ◊Turn the NAND and NOR gates into inverter (NOT) gates. Hint: Look at the Truth Table. Basic Gates 2.10

Exercise 3 ◊Draw the following circuit: AB + BC Basic Gates 2.11

Exercise 4 ◊Describe the function of a NAND gate, starting with the term “If any input...” ◊Describe the function of a NOR gate, starting with the term “If any input...” Basic Gates 2.12

DeMorgan

DeMorgan Theorem ◊The DeMorgan Theorem describes a method for converting between AND/NAND and OR/NOR operations. ◊The theorem states: A ● B = A + B A + B = A ● B “Break the bar and change the sign” Basic Gates 2.14

DeMorgan An example of DeMorgan: AB + BC ABC Original Equation DeMorgan applied to NOR expression Double inversions cancel Simplified expression AB ● BC Basic Gates 2.15

DeMorgan Exercise 1 Use DeMorgan to simplify the following expressions A+B+C AB AB + C+D “Break the bar and change the sign” Basic Gates 2.16

Universal Gates ◊The NAND and NOR gates are considered Universal Gates. They can be used to create any other gate. ◊Using universal gates is an important aspect of digital logic design. Examples provided in class. Basic Gates 2.17

NAND and NOR as NOT Z A Vcc A Z Method 1 AZ A Z Method 2 A Z Basic Gates 2.18

NAND and NOR as AND Z B A Z B A AB = AB = A+B (DeMorgan) A Z B Basic Gates 2.19

NAND and NOR as OR A+B = A+B = AB (DeMorgan) Z B A A Z B Z B A Basic Gates 2.20

Universal Gates Exercise 1 ◊Convert NAND as NOR ◊Convert NOR as NAND Basic Gates 2.21

Example: Universal Gates Convert the following circuit to NAND only: Convert each of the gates in the circuit to its NAND equivalent and progressively re-draw the circuit. Additional Examples given in class Basic Gates 2.22

Active Input States

Digital 1’s and 0’s ◊In a binary system, the logic 1’s are as important as the logic 0’s. A “0” is a signal also. ◊When the “0” forces a change it is called Active Low (the low causes the action). ◊When the “1” forces a change it is called Active High (the high causes the action). Basic Gates 2.24

Active Low State ◊Many, many devices use the logic low to cause something to change. ◊Resets and presets on digital devices ◊Communication systems ◊Active low inputs are indicated with either an overbar on the input label, and/or a bubble in front of the output. Basic Gates 2.25 Reset

Comparison of Active States A logic 0 causes the LED to light up A logic 1 causes the LED to light up Vcc Basic Gates 2.26

Alternate Gate Representations

Comparison of Active Inputs A Z B Active Low Inputs Active High Output Active High Inputs Active Low Output Z B A Basic Gates 2.28

Bubble to Bubble ◊Alternate gate representations can make circuit analysis faster. ◊A bubble attached to a bubble means the bubbles cancel. Basic Gates 2.29 = Bubbles Cancel

Bubble to Bubble Cancellation Example Basic Gates Z 1 A B C In this example with bubble-to-bubble representation, the output bubble from gate 1 cancels with the input bubble from gate 2. This makes it easy to quickly determine that if either A or B inputs are low, outcome Z is low. 2 Z 1 A B C

Alternate Representations ◊The “bubble” on a gate represents inversion. ◊In many cases it is easier to follow the circuit logic if “bubble” outputs are linked to “bubble” inputs ◊Cancelled bubbles helps make the active input state more easily visible for troubleshooting Basic Gates 2.31

Example use of Alternate Representation ◊The output is active when the input state is a 101 ◊Note how much easier it is to see the active input at a glance using a bubble instead of a NOT gate. Z C B A Basic Gates 2.32

Example of Alternate Representation A Z B Z B A A Z B Equals A+B = AB (DeMorgan) Basic Gates 2.33

Alternate Representation Z B A Z A Z A Z A Z B A B Z B A Z B A Z A Z B A B Z B A Basic Gates 2.34

Alternate Representation Exercise Z A Z B A B Z A Z B A B Identify the gate that is alternately represented Basic Gates 2.35

Alternate Representation Exercise ANSWERS Z A Z B A B Z A Z B A B Identify the gate that is alternately represented Basic Gates 2.36

END ©Paul R. Godin prgodin gmail.com Basic Gates 2.37