Circuits Logic in Hardware.

Slides:



Advertisements
Similar presentations
Chapter 4 Gates and Circuits.
Advertisements

Logic Gates.
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.
Logic Gates Some Most All Learning Objective
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Chapter 4 Gates and Circuits.
ADDER, HALF ADDER & FULL ADDER
Chapter 4 Gates and Circuits.
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
The Analytical Engine Hardware. The Logic Machine Computers were originally wired to perform a specific task. The vision was a machine that could perform.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Simple One and Two Input Logic Gates Truth Tables and Function Tables Based Upon 0 – 5 V.
The Laws of Logic: Boolean Algebra A State High Math Club Presentation START==TRUE.
UNIT-8 LOGIC GATES.
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.
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
1 CHAPTER 4: PART I ARITHMETIC FOR COMPUTERS. 2 The MIPS ALU We’ll be working with the MIPS instruction set architecture –similar to other architectures.
Binary Numbers.
Chapter 4 Gates and Circuits. Integrated Circuits aka CHIPS What’s in this thing???? 4–2.
Chapter 4 Gates and Circuits.
Binary Addition CSC 103 September 17, 2007.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Chapter 2: Fundamentals of Digital Electronics Dr Mohamed Menacer Taibah University
School of Computer Science G51CSA 1 Computer Systems Architecture Fundamentals Of Digital Logic.
Digital Components and Combinational Circuits Sachin Kharady.
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.
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.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Universal college of engineering & technology. .By Harsh Patel)
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Digital Computers Logic Gates & Applications. Digital Computers Types of Material (Electric Conductivity) – Insulator Rubber / wood – Conductor Copper.
Basic Electricity and Electronics Module Three Microprocessor Basics Copyright © Texas Education Agency, All rights reserved.
Simple ALU  Half adder  Full adder  Constructing 4 bits adder  ALU does several operations  General ALU structure  Timing diagram of adder  Overflow.
Digital electronics 4–1 Gates and Circuits SANJAYBHAI RAJGURU COLLEGE OF ENGG.
Winter 2016CISC101 - Prof. McLeod1 Today How transistors can carry out commands in a CPU. For example, how to add two integers in an integrated circuit.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
 A transistor is the basic building block of electronic components.  The average computer may have millions of them within its circuits.  Essentially,
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.
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.
Chapter 3 - Binary Numbering System
Eng. Mai Z. Alyazji October, 2016
ECE 331 – Digital System Design
CSCI-100 Introduction to Computing
Digital Signals Digital Signals have two basic states:
Fundamentals & Ethics of Information Systems IS 201
Chapter 4 Gates and Circuits.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Computer Science 210 Computer Organization
Fundamentals of Computer Science Part i2
SOLIDS AND SEMICONDUCTOR DEVICES - IV
Schematics 201 Lecture Topic: Electrical Symbols
Number Systems Decimal (base 10) { }
Digital Electronics Lab 2 Instructor:
Logic Gates.
Boolean Algebra.
Week 7: Gates and Circuits: PART II
Digital Logic.
Logic Gates.
SOLIDS AND SEMICONDUCTOR DEVICES - IV
DIGITAL ELECTRONICS B.SC FY
Logic Gates.
Binary Logic.
XOR Function Logic Symbol  Description  Truth Table 
Digital Circuits and Logic
SOLIDS AND SEMICONDUCTOR DEVICES - IV
Presentation transcript:

Circuits Logic in Hardware

What is a Circuit? A circuit is a collection of connected electrical components, such as wires, voltage sources, resistors, transistors, and so forth. Electricity flows through the circuit like water through an irrigation system. Voltage: Force behind the flow. Current: Rate of flow. Electrical components control the voltage and current on each wire.

Physical Circuits The circuit may be placed on a piece of plastic, called a circuit board. The circuit may be compressed into a single microchip. In either case, the ideas behind the design are similar.

Circuit Diagrams Circuit diagrams describe the circuit. Each component has a standardized symbol to be used in the diagrams.

Circuit Components Voltage source: acts like a pump. Resistor: reduces voltage. Ground: eliminates voltage. Transistor: acts like a gate.

Transistors Transistors have three connections: base, collector, and emitter. A small current applied to the base allows the large current to flow through the transistor from the collector to the emitter.

Logical Gates In digital circuits, the presence or absence of voltage translates to binary digits (bits). 0V = binary 0 = logical FALSE +5V = binary 1 = logical TRUE A gate is a circuit which detects input voltage to control output voltage. Gates are used as subcircuits of digital circuits to perform standard logical operations. Each logical operator has a corresponding gate represented by its own symbol.

NOT Gate NOT Symbol NOT Table A Q 1

AND Gate AND Symbol AND Table A B Q 1

OR Gate OR Symbol OR Table A B Q 1

NAND Gate NAND Symbol NAND Table A B Q 1

NOR Gate NOR Symbol NOR Table A B Q 1

XOR Gate XOR Symbol XOR Table A B Q 1

XNOR Gate XNOR Symbol XNOR Table Q 1 electrical XNOR corresponds to logical IFF

NAND Circuit A NAND circuit sinks voltage on one output exactly when there is voltage on either of two inputs. The resistors on the inputs limit the base-emitter current to just enough to turn the transistors on. If both transistors are on (both inputs +5V, or 1) the output will be connected to ground (be at 0V, or 0). If either transistor is off, the output is connected through the resistor to +5V.

NAND Symbol The NAND schematic symbol represents the NAND circuit diagram. Since all digital circuits circuits have the same +5V and 0V power supply connections, we can eliminate them from the symbol.

Gate Construction: NOT NOT A = A NAND A

Gate Construction: AND A AND B = NOT(A NAND B)

Gate Construction: OR A OR B = (NOT A) NAND (NOT B)

Operator Construction: XOR C = A NAND B = NOT(A AND B) = NOT(A) OR NOT(B) Note: A AND C = A AND NOT(B) Note: B AND C = B AND NOT(A) D = A NAND C = NOT(A AND NOT(B)) E = B NAND C = NOT(B AND NOT(A)) D NAND E = NOT(D AND E) D NAND E = NOT(D) OR NOT(E) D NAND E = (A AND NOT(B)) OR (B AND NOT(A)) D NAND E = A XOR B

Gate Construction: XOR C = A NAND B D = A NAND C E = B NAND C A XOR B = D NAND E A D C B E

Gate Construction: NOR, XNOR A NOR B = NOT(A OR B) A XNOR B = NOT(A XOR B)

Adder Concept Recall binary addition; we add two bits at a time, plus a possible carry bit. 1 1 0111 + 0110 ------ 1 1 1 An adder is a circuit which takes three input bits (two summands and carry in) and produces two output bits (the sum and the carry out).

Adder Table A,B: summands I: carry in Q: sum mod 2 O: carry out A B I 1 We wish to analyze the sequence of logical operations required to compute O and Q, so that we can construct a circuit to output them.

Sum Bit Addition modulo two for a pair of bits is given by 0+0=0 1+0=1 0+1=1 1+1=0 This is XOR; but summing requires 3 bits. Sum bit Q is on if just one of the three inputs A, B, I is on, or if all three are on. Q = (just A) OR (just B) OR (just I) OR (all 3 on)

Carry Bit Carry bit O is on if at least two of the three inputs A, B, I are on, O = (A AND B) OR (A AND I) OR (B AND I)

Adder Circuit The complete adder circuit is as follows. A = Input 1 B = Input 2 I = Carry In Q = Sum O = Carry Out A & B B & I A & I just B just A just I all on

Arithmetic Logic Unit (ALU) Circuit Input: A,B and I Output: A+B,O Output: A AND B Output: A OR B Output: A XOR B Output: NOT A Adder and ALU Circuits courtesy of Donn Stewart

References http://cpuville.4t.com/index.htm http://en.wikipedia.org