How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B 0 0 0 1 1 0 1 1 0 0 0 1 A B 0 0 0 1 1 0 1 1 0 1 1 1.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

ADDER, HALF ADDER & FULL ADDER
ECE 301 – Digital Electronics
TDC 311 Digital Logic. Truth Tables  AND  OR  NOT  NAND  NOR  XOR  XNOR.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
AND Gate: A Logic circuit whose output is logic ‘1’ if and only if all of its inputs are logic ‘1’.
 Arithmetic circuit  Addition  Subtraction  Division  Multiplication.
Simple One and Two Input Logic Gates Truth Tables and Function Tables Based Upon 0 – 5 V.
XOR, XNOR, and Binary Adders
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
1 Introduction to Abstract Mathematics Applications : Digital Logic Circuits 2.4 and Number Systems 2.5 Instructor: Hayk Melikya
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 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
TODAY YOU ARE LEARNING to explain why data is represented in computer systems in binary form 2. to understand and produce simple logic diagrams.
Using building blocks to make bigger circuits
Digital Components and Combinational Circuits Sachin Kharady.
What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
Gates and Logic Dr John Cowell phones off (please)
Computer Science 101 Circuit Design - Examples. Sum of Products Algorithm Identify each row of the output that has a 1. Identify each row of the output.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
DAT2343 Arithmetic Circuits For Unsigned Binary Values © Alan T. Pinck / Algonquin College; 2003.
Half-Adder: A combinational circuit which adds two one-bit binary numbers is called a half-adder. The sum column resembles like an output of the XOR gate.
ARITHMETIC MICRO OPERATIONS
Universal college of engineering & technology. .By Harsh Patel)
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Logic and computers 2/6/12. Binary Arithmetic /6/ Only two digits: the bits 0 and 1 (Think: 0 = F, 1.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
1 Carry Lookahead Logic Carry Generate Gi = Ai Bi must generate carry when A = B = 1 Carry Propagate Pi = Ai xor Bi carry in will equal carry out here.
Logic Gates. AND gate Produces an output only if both inputs are on Input AInput BOutput (Q) Q=
COMBINATIONAL LOGIC.
AND Gate Inputs Output Input A (Switch) Input B (Switch) Output Y (Lamp) 0 (Open) 0 (OFF) A B Lamp.
1 Ethics of Computing MONT 113G, Spring 2012 Session 4 Binary Addition.
Simple ALU  Half adder  Full adder  Constructing 4 bits adder  ALU does several operations  General ALU structure  Timing diagram of adder  Overflow.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
1 Logic Gates CS 202, Spring 2008 Epp, sections 1.4 and 1.5.
Electrical Engineering Engineering the Future Digital Circuits Fundamentals Hands-on Full-Adder Simulation (afternoon)
Explain Half Adder and Full Adder with Truth Table.
1 Review of Boolean algebra Not is a horizontal bar above the number –0 = 1 –1 = 0 Or is a plus –0+0 = 0 –0+1 = 1 –1+0 = 1 –1+1 = 1 And is multiplication.
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
Combinational Circuits
ECE 3130 Digital Electronics and Design
Logic Gates Practical Objective: to develop an understanding of logic circuits and truth tables.
Homework Reading Machine Projects Labs
Combinational Circuits
Computer Architecture CST 250
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
Elec 2607 Digital Switching Circuits
Logic Gates.
Boolean Algebra.
Week 7: Gates and Circuits: PART II
Digital Logic.
Number Systems and Circuits for Addition
Logic Gates.
Logic Gates.
Homework Reading Machine Projects Labs
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.
Logic Gates.
XOR, XNOR, and Binary Adders
Combinational Circuits
XOR Function Logic Symbol  Description  Truth Table 
LOGIC Circuits.
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Presentation transcript:

How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B

Exclusive OR gate: XOR Gate A B Output A B

Simple Adder Circuit: AND Gate 0 0 Carry over = 0 XOR Gate 0 0 Output = 0 AND Gate 1 0 Carry over = 0 XOR Gate 1 0 Output = 1 + +

Simple Adder Circuit: AND Gate 0 1 Carry over = 0 XOR Gate 0 1 Output = 1 AND Gate 1 1 Carry over = 1 XOR Gate 1 1 Output = 0 + +

Full Adder circuit 0 + 0, carry = 0 AND Gate 0 0 Carry over = 0 XOR Gate Carry over input = 0 0 Output = 0 OR Gate AND Gate 0 XOR Gate

Full Adder circuit 0+1, carry = 0: AND Gate 0 1 Carry over = 0 XOR Gate Carry over input = 0 0 Output = 1 OR Gate AND Gate 1 XOR Gate

Full Adder circuit 1+0, carry = 1: AND Gate 1 1 Carry over = 1 XOR Gate Carry over input = 1 0 Output = 0 OR Gate AND Gate 1 XOR Gate

Multi-Bit Adder: X. Y. Z. XYZXYZ XYZXYZ XYZXYZ C. C. C.C.