NAND, NOR, and EXOR (more primitive logical gates) CS 147 - Computer Architecture David Mayer.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

CT455: Computer Organization Logic gate
Computer Science 210 Computer Organization Introduction to Logic Circuits.
Programmable Logic Controllers.
Combinational Logic Circuits Chapter 2 Mano and Kime.
CSIS 3510 Computer Organization and Architecture Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a.
ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
Combinational Logic Circuits Chapter 2 Mano and Kime.
Logic Circuits In today’s lesson we will look at: the symbols for NOT, AND, OR and EOR using truth tables to represent logic circuits two new operators.
1 Fundamentals of Computer Science Propositional Logic (Boolean Algebra)
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
DeMorgan Theorem, Computer Simulation Exercises
Fall 2012: FCM 708 Foundation I Lecture 2 Prof. Shamik Sengupta
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
Logic and Computer Design Simon Petruc-Naum CS 147 – Dr. S.M. Lee.
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.
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
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.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 2.
BASIC LOGIC GATES. In studying digital in integrated circuits, one must start with the simples group of circuits, the SSIs or Small Scale Integrated Circuits.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.
Logic Gates. AND gate Produces an output only if both inputs are on Input AInput BOutput (Q) Q=
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,
Boolean Algebra Computer Architecture. Digital Representation Digital is an abstraction of analog voltage –Voltage is a continuous, physical unit Typically.
Dept. of Electrical and Computer Eng., NCTU 1 Lab 2. NAND and XOR Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
Logic Gates and Boolean Algebra Introduction to Logic II.
Lecture 21: Combinatorial Circuits II Discrete Mathematical Structures: Theory and Applications.
Boolean Algebra. LO:  Understand why Boolean algebra is used  Understand basic Boolean algebra notation  Understand why Boolean algebra is used  Understand.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Mu.com.lec 9. Overview Gates, latches, memories and other logic components are used to design computer systems and their subsystems Good understanding.
CS 111 – Aug. 27 Section 1.1 –Binary data and operations –Logic gates –Flip-flop –A binary shorthand: hexadecimal Commitment for next day: –Please read.
Basic Gates and ICs 74LS00 Quad 2-Input NAND gate 74LS02 Quad 2-Input NOR gate 74LS04 Quad 2-Input NOT gate 74LS08 Quad 2-Input AND gate 74LS32 Quad 2-Input.
Logic Gates Learning Objectives Learn that there is a one-to-one relationship between logic gates and Boolean expressions Learn how logic gates are combined.
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Eng. Mai Z. Alyazji October, 2016
Combinational Logic Logic gates. and, or, not Derived gates.
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
Logic Gates and Boolean Algebra
Logic Gates, Boolean Algebra and Karnaugh Maps
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
Exclusive OR Gate.
Digital Logic.
Basic Logical Operations (Fascinating)
Digital Signals Digital Signals have two basic states:
Computer Science 210 Computer Organization
Agenda – 2/12/18 Questions? Readings: CSI 4, P
CS Chapter 3 (3A and ) Part 3 of 8
Logic Gates.
Digital Logic.
Logic Gates.
CS Chapter 3 (3A and ) – Part 2 of 5
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.
Chapter 4 Gates and Circuits.
XOR, XNOR, and Binary Adders
Truth tables Mrs. Palmer.
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Introduction to Logic diagrams and truth tables
Dept. of Electrical and Computer Eng., NCTU
Introduction to Logic diagrams and truth tables
What are Logic Gates?.
Presentation transcript:

NAND, NOR, and EXOR (more primitive logical gates) CS Computer Architecture David Mayer

Uses for NAND, NOR, and EXOR gates Control systems, such as for air conditioning and automobiles. Circuit boards, for on-board logic. Internally, in more complex integrated circuit chips.

NAND = Negated AND Symbols for Logic Diagram TRUE iff any of its inputs are FALSE

NAND with Karnaugh Map (K-Map) K-Map

NAND with Algebraic Equation K-Map Q = AB (or just Q = AB) Algebraic Equation

NAND (all forms) K-Map Q = AB

NOR = Negated OR Symbols for Logic Diagram FALSE iff any of its inputs are TRUE

NOR with K-Map K-Map

NOR with Algebraic Equation Q = A+B Algebraic Equation

NOR (all forms) Q = A+B

EXOR = Exclusive OR (often symbolized XOR) Symbol for Logic Diagram TRUE iff only one of its inputs is TRUE

XOR with K-Map K-Map

XOR with Algebraic Equation Algebraic Equation Q = A B

XOR (all forms) Q = A B

NAND is a universal gate Can be used to implement all Boolean functions. == =

More NAND as universal gate == ==

NOR is also a universal gate == =

More NOR as universal gate == ==

The NAND circuit is much simpler to implement than the NOR circuit, and the NAND is a universal gate; so chip manufacturers typically make all their logical devices (primitive or otherwise) out of combinations of NAND gates, to simplify the manufacturing design process.

Questions or comments?