Chapter 4: Gates and Circuits Chapter 4 Gates and Circuits Page 30 The AND Operation (i.e., are both operands “true”?) 1 AND 1 11 AND 0 00 AND 1 00 AND.

Slides:



Advertisements
Similar presentations
Chapter 4 Gates and Circuits.
Advertisements

Gates and Circuits Nell Dale & John Lewis (adaptation by Erin Chambers and Michael Goldwasser)
CT455: Computer Organization Logic gate
Computer Science 210 Computer Organization Introduction to Logic Circuits.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Chapter 4 Gates and Circuits.
CP208 Digital Electronics Class Lecture 11 May 13, 2009.
Number Representation and Logic Design CS 3220 Fall 2014 Hadi Esmaeilzadeh Georgia Institute of Technology Some slides adopted from.
GRAPHENE TRANSISTORS AND MEMORY. MOORE’S LAW THE PROBLEM 1. Reduction in saturation mode drain current. 2. Variation in Carrier velocity. 3. Modification.
Chapter 4 Gates and Circuits.
11/8/2004EE 42 fall 2004 lecture 291 Lecture #29 CMOS fabrication, clocked and latched circuits Last lecture: PMOS –Physical structure –CMOS –Dynamic circuits.
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
Lecture 3. Boolean Algebra, Logic Gates
Device Fabrication Example
Logic Gates Combinational Circuits
Unit 7, Chapter 24 CPO Science Foundations of Physics.
3. DIGITAL ELECTRONICS..
Lecture 3. Boolean Algebra, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Chapter 4 Gates and Circuits. 4–2 Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors.
Chapter 4 Gates and Circuits.
Boolean math is the cornerstone of digital communications, whether you are talking computers, PLC, or Cisco Routers on the Internet. ©Emil Decker, 2009.
1 A Balanced Introduction to Computer Science, 2/E David Reed, Creighton University ©2008 Pearson Prentice Hall ISBN Chapter 16 Inside.
Lecture 3. Error Detection and Correction, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Chapter 4 Gates and Circuits. Integrated Circuits aka CHIPS What’s in this thing???? 4–2.
Chapter 4 Gates and Circuits.
OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.
Chapter 2: Fundamentals of Digital Electronics Dr Mohamed Menacer Taibah University
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
CSCI-235 Micro-Computers in Science Hardware Design Part I.
Logic Gates How Boolean logic is implemented. Transistors used as switches to implement Boolean logic: ANDOR Logic with Transistors.
CPS120: Introduction to Computer Science
Digital Components and Combinational Circuits Sachin Kharady.
1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.
Multiplexers 1 The output is equal to one of several input signals to the circuit The multiplexer selects which input signal to use as an output signal.
Logic and Computer Design Simon Petruc-Naum CS 147 – Dr. S.M. Lee.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
CSCI-100 Introduction to Computing Hardware Design Part I.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
CHAPTER-2 Fundamentals of Digital Logic. Digital Logic Digital electronic circuits are used to build computer hardware as well as other products (digital.
Introduction to Computing Systems and Programming Digital Logic Structures.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
Systems Architecture, Fourth Edition 1 Processor Technology and Architecture Chapter 4.
Digital electronics 4–1 Gates and Circuits SANJAYBHAI RAJGURU COLLEGE OF ENGG.
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.
Winter 2016CISC101 - Prof. McLeod1 Today Take some of the “MAGIC” out of how computers work: How did the technology get to where it is today? –ENIAC movie.
L OGIC G ATES Computer Organization – week 3. W HAT ’ S ALU? 1. ALU stands for: Arithmetic Logic Unit 2. ALU is a digital circuit that performs Arithmetic.
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.
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.
Week 1: Introduction and Logic gates IT3002 – Computer Architecture
Logic Gates Unit 16.
Computer Architecture & Operations I
Computer Architecture & Operations I
Morgan Kaufmann Publishers
Circuits Logic in Hardware.
CSCI-100 Introduction to Computing
Digital Signals Digital Signals have two basic states:
Chapter 4 Gates and Circuits.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Computer Science 210 Computer Organization
Digital Logic Structures Logic gates & Boolean logic
For OCR GCSE Computing Unit 1 - Theory
Week 7: Gates and Circuits: PART II
Digital Logic.
Logic Gates.
Logic Gates.
Chapter 10.3 and 10.4: Combinatorial Circuits
CS149D Elements of Computer Science
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Presentation transcript:

Chapter 4: Gates and Circuits Chapter 4 Gates and Circuits Page 30 The AND Operation (i.e., are both operands “true”?) 1 AND 1 11 AND 0 00 AND 1 00 AND AND AND The OR Operation (i.e., is either operand “true”?) 1 OR 1 11 OR 0 10 OR 1 10 OR OR OR The following Boolean operations are easy to incorporate into circuitry and can form the building blocks of many more sophisticated operations… The NOT Operation (i.e., what’s the opposite of the operand’s value?) NOT 1 = 0 NOT 0 = 1 NOT = NOT =

More Boolean Operators Chapter 4 Gates and Circuits Page 31 The NAND Operation (“NOT AND”) 1 NAND 1 01 NAND 0 10 NAND 1 10 NAND NAND NAND The NOR Operation (“NOT OR”) 1 NOR 1 01 NOR 0 00 NOR 1 00 NOR NOR NOR The XOR Operation (“Exclusive OR”, i.e, either but not both is “true”) 1 XOR 1 01 XOR 0 10 XOR 1 10 XOR XOR XOR

Transistors Chapter 4 Gates and Circuits Page 32 Transistors are relatively inexpensive mechanisms for implementing the Boolean operators. In addition to the input connection (the base) Transistors are connected to both a power source and a voltage dissipating ground. Essentially, when the input voltage is high, an electric path is formed within the transistor that causes the power source to be drained to ground. When the input voltage is low, the path is not created, so the power source is not drained.

Using Transistors to Create Logic Gates Chapter 4 Gates and Circuits Page 33 A NOT gate is essentially implemented by a transistor all by itself. A NAND gate uses a slightly more complex setup in which both inputs would have to be high to force the power source to be grounded. A NOR gate grounds the power source if either or both of the inputs are high. Use the output of a NAND gate as the input to a NOT gate to produce an AND gate, Use the output of a NOR gate as the input to a NOT gate to produce an OR gate..

How to Use Logic Gates for Arithmetic Chapter 4 Gates and Circuits Page 34 ANDs and ORs are all well and good, but how can they be used to produce binary arithmetic? Let’s start with simple one-bit addition (with a “carry” bit just in case someone tries to add 1 + 1!). SumBitCarryBit 0+0=00 0+1=10 1+0=10 1+1=01 Result0XOR0=0 0XOR1=1 1XOR0=1 1XOR1=0Result0AND0=0 0AND1=0 1AND0=0 1AND1=1 Notice that the sum bit always yields the same result as the XOR operation, and the carry bit always yields the same result as the AND operation! By combining the right circuitry, then, multiple-bit addition can be implemented, as well as the other arithmetic operations.

Memory Circuitry Chapter 4 Gates and Circuits Page 35 With voltages constantly on the move, how can a piece of circuitry be used to retain a piece of information? In the S-R latch, as long as the S and R inputs remain at one, the value of the Q output will never change, i.e., the circuit serves as memory! To set the stored value to one, merely set the S input to zero (for just an instant!) while leaving the R input at one. To set the stored value to zero, merely set the R input to zero (for just an instant!) while leaving the S input at one. Question: What goes wrong if both inputs are set to zero simultaneously?

Integrated Circuits Chapter 4 Gates and Circuits Page 36 How does all of that elaborate circuitry get placed on the tiny microchips used in modern computers? A clean silicon wafer is oxidized to produce a thin layer of silicon dioxide, which is then coated with a radiation-sensitive film. The wafer is masked by lithography to expose it selectively to ultraviolet light, which causes the film layer to become dissolvable. Light-exposed areas are dissolved, exposing parts of the silicon dioxide layer, which are removed by an etching process. The remaining film is removed in a liquid bath. The areas of silicon exposed by the etching process are negatively charged by exposure to either arsenic or phosphorus vapor at high temperatures The areas covered by silicon dioxide remain positively charged. The silicon dioxide is removed The wafer is oxidized again. An opening is etched down to the positively charged silicon using a reverse mask. Another oxidation cycle forms a thin layer of silicon dioxide on the positively charged region of the wafer. Windows are etched in the negatively charged silicon areas in preparation for metal deposits.