CS105 Introduction to Computer Concepts GATES and CIRCUITS

Slides:



Advertisements
Similar presentations
Adders Used to perform addition, subtraction, multiplication, and division (sometimes) Half-adder adds rightmost (least significant) bit Full-adder.
Advertisements

Chapter 3 Basic Logic Gates 1.
Chapter 4 Gates and Circuits.
Chapter 4 Gates and Circuits Nell Dale • John Lewis.
Chapter 4 Gates and Circuits.
Discrete Mathematical Structures: Theory and Applications
Chapter 3 Logic Gates.
Gates and Circuits Nell Dale & John Lewis (adaptation by Erin Chambers and Michael Goldwasser)
Digital Logic Design Gate-Level Minimization
Introduction to Logic Gates
The scale of IC design Small-scale integrated, SSI: gate number usually less than 10 in a IC. Medium-scale integrated, MSI: gate number ~10-100, can operate.
Chapter 3 (part 1) Basic Logic Gates 1.
Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:
Logic Gates Flip-Flops Registers Adders
Exclusive-OR and Exclusive-NOR Gates
(CSC 102) Discrete Structures Lecture 5.
Quiz # 1 Chapters 1,2,3, & 4.
Chapter 4 Gates and Circuits.
Flip-Flops and Registers
Chapter 4 Gates and Circuits.
Chapter 4 Gates and Circuits.
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
Informationsteknologi Friday, October 19, 2007Computer Architecture I - Class 81 Today’s class Digital Logic.
Gates CS105. Electrical Signals Transmission of data Any electrical signal has a level of voltage – Interpretation of 1s and 0s Generally speaking: –
Lecture 3. Boolean Algebra, Logic Gates
Gates A digital circuit is one in which only two logical values are present. Typically, a signal between 0 and 1 volt represents one value (e.g. binary.
Any logic circuits can be transformed to an implementation where only NAND gates (and inverters) are used. The general approach to finding a NAND-gate.
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.
Lecture 3. Error Detection and Correction, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Quiz # 2 Chapters 4, 5, & 6.
Chapter 4 Gates and Circuits. Integrated Circuits aka CHIPS What’s in this thing???? 4–2.
Chapter 4 Gates and Circuits.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
CPS120: Introduction to Computer Science
Digital Components and Combinational Circuits Sachin Kharady.
The Digital Logic Level
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Digital Logic. 4 Why is 32-bit or 64-bit significant in terms of speed, efficiency? 4 Difference between OR and XOR 4 What is a mux for? PLA 4 Two kinds.
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.
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.
LOGIC GATES. Electronic digital circuits are also called logic circuits because with the proper input, they establish logical manipulation paths. Each.
Magnitude Comparator Dr. Ahmed Telba.
Digital Computers Logic Gates & Applications. Digital Computers Types of Material (Electric Conductivity) – Insulator Rubber / wood – Conductor Copper.
Digital electronics 4–1 Gates and Circuits SANJAYBHAI RAJGURU COLLEGE OF ENGG.
Logic Gates Dr.Ahmed Bayoumi Dr.Shady Elmashad. Objectives  Identify the basic gates and describe the behavior of each  Combine basic gates into circuits.
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.
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.
Week 1: Introduction and Logic gates IT3002 – Computer Architecture
CSIS-110 Introduction to Computer Science
Basics of Logic gates - Part 2
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Chapter 3 - Binary Numbering System
Dr.Ahmed Bayoumi Dr.Shady Elmashad
CS140 Lecture 03: The Machinery of Computation: Combinational Logic
NAND-ONLY LOGIC CIRCUITS
Chapter 4 Gates and Circuits.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Fundamentals of Computer Science Part i2
Agenda – 2/12/18 Questions? Readings: CSI 4, P
Week 7: Gates and Circuits: PART II
Logic Gates.
Logic Circuits I Lecture 3.
Chapter 4 Gates and Circuits.
XOR Function Logic Symbol  Description  Truth Table 
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Presentation transcript:

CS105 Introduction to Computer Concepts GATES and CIRCUITS Instructor: Cuong (Charlie) Pham

Outline Gates Circuits Types Construction Adder Multiplexer Memory IC CS105 Section 1 - Lecture 5 2/16/2012

Computers and Electricity Definitions: Gate: A device that performs a basic operation on electrical signals Circuits: Gates combined to perform more complicated tasks How do we describe the behavior of gates and circuits? Boolean expressions: Uses Boolean algebra, a mathematical notation for expressing two-valued logic Logic diagrams: A graphical representation of a circuit; each gate has its own symbol Truth tables: A table showing all possible input value and the associated output values CS105 Section 1 - Lecture 5 2/16/2012

Gate Types Six types of gates NOT AND OR XOR NAND NOR CS105 Section 1 - Lecture 5 2/16/2012

NOT Gate A NOT gate accepts one input signal (0 or 1) and returns the opposite signal as output Figure 4.1 Various representations of a NOT gate CS105 Section 1 - Lecture 5 2/16/2012

AND Gate An AND gate accepts two input signals If both are 1, the output is 1; otherwise, the output is 0 Figure 4.2 Various representations of an AND gate CS105 Section 1 - Lecture 5 2/16/2012

Figure 4.3 Various representations of a OR gate An OR gate accepts two input signals If both are 0, the output is 0; otherwise, the output is 1 Figure 4.3 Various representations of a OR gate CS105 Section 1 - Lecture 5 2/16/2012

XOR Gate (exclusive OR) An XOR gate accepts two input signals If both are the same, the output is 0; otherwise, the output is 1 Figure 4.4 Various representations of an XOR gate CS105 Section 1 - Lecture 5 2/16/2012

NAND Gate The NAND gate accepts two input signals If both are 1, the output is 0; otherwise, the output is 1 Figure 4.5 Various representations of a NAND gate CS105 Section 1 - Lecture 5 2/16/2012

NOR Gate The NOR gate accepts two input signals If both are 0, the output is 1; otherwise, the output is 0 Figure 4.6 Various representations of a NOR gate CS105 Section 1 - Lecture 5 2/16/2012

Gates with More Inputs Gates can be designed to accept three or more input values A three-input AND gate, for example, produces an output of 1 only if all input values are 1 Figure 4.7 Various representations of a three-input AND gate CS105 Section 1 - Lecture 5 2/16/2012

Constructing Gates Transistor A device that acts either as a wire that conducts electricity or as a resistor that blocks the flow of electricity, depending on the voltage level of an input signal A transistor has no moving parts, yet acts like a switch It is made of a semiconductor material, which is neither a particularly good conductor of electricity nor a particularly good insulator CS105 Section 1 - Lecture 5 2/16/2012

Constructing Gates A transistor has three terminals A source A base An emitter, typically connected to a ground wire If the electrical signal is grounded, it is allowed to flow through an alternative route to the ground (literally) where it can do no harm Figure 4.8 The connections of a transistor CS105 Section 1 - Lecture 5 2/16/2012

Constructing Gates The easiest gates to create are the NOT, NAND, and NOR gates Figure 4.9 Constructing gates using transistors CS105 Section 1 - Lecture 5 2/16/2012

Circuits Combinational circuit: The input values explicitly determine the output Sequential circuit: The output is a function of the input values and the existing state of the circuit CS105 Section 1 - Lecture 5 2/16/2012

Combinational Circuits Gates are combined into circuits by using the output of one gate as the input for another CS105 Section 1 - Lecture 5 2/16/2012

Combinational Circuits Consider the following Boolean expression A(B + C) Does this truth table look familiar? Compare it with previous table CS105 Section 1 - Lecture 5 2/16/2012

Combinational Circuits Circuit equivalence Two circuits that produce the same output for identical input Boolean algebra allows us to apply provable mathematical principles to help design circuits E.g., A(B + C) = AB + BC (distributive law) so circuits must be equivalent CS105 Section 1 - Lecture 5 2/16/2012

Adders At the digital logic level, addition is performed in binary Addition operations are carried out by special circuits called, appropriately, adders CS105 Section 1 - Lecture 5 2/16/2012

Adders The result of adding two binary digits could produce a carry value Recall that 1 + 1 = 10 in base two Half adder A circuit that computes the sum of two bits and produces the correct carry bit Truth table CS105 Section 1 - Lecture 5 2/16/2012

Adders Full adder A circuit that takes the carry-in value into account Figure 4.10 A full adder CS105 Section 1 - Lecture 5 2/16/2012

Multiplexers Multiplexer A circuit that uses a few input control signals to determine which of several output data lines is routed to its output CS105 Section 1 - Lecture 5 2/16/2012

Multiplexers The control lines S0, S1, and S2 determine which of eight other input lines (D0 … D7) are routed to the output (F) Figure 4.11 A block diagram of a multiplexer with three select control lines CS105 Section 1 - Lecture 5 2/16/2012

Circuits as Memory Digital circuits can be used to store information These circuits form a sequential circuit, because the output of the circuit is also used as input to the circuit CS105 Section 1 - Lecture 5 2/16/2012

Circuits as Memory An S-R latch stores a single binary digit (1 or 0) There are several ways an S-R latch circuit can be designed using various kinds of gates Figure 4.12 An S-R latch CS105 Section 1 - Lecture 5 2/16/2012

Circuits as Memory The design of this circuit guarantees that the two outputs X and Y are always complements of each other The value of X at any point in time is considered to be the current state of the circuit Therefore, if X is 1, the circuit is storing a 1; if X is 0, the circuit is storing a 0 Figure 4.12 An S-R latch CS105 Section 1 - Lecture 5 2/16/2012

Integrated Circuits Integrated circuit (also called a chip) A piece of silicon on which multiple gates have been embedded Silicon pieces are mounted on a plastic or ceramic package with pins along the edges that can be soldered onto circuit boards or inserted into appropriate sockets CS105 Section 1 - Lecture 5 2/16/2012

Integrated Circuits Integrated circuits (IC) are classified by the number of gates contained in them CS105 Section 1 - Lecture 5 2/16/2012

Integrated Circuits Figure 4.13 An SSI chip contains independent NAND gates CS105 Section 1 - Lecture 5 2/16/2012