CompSci 001 29.1 Today’s topics Computer Hardware Electric Circuits Designing an Adder Upcoming Computer Communications ( Great Ideas Chapter 10) Reading.

Slides:



Advertisements
Similar presentations
Conversion and Coding (12)10.
Advertisements

Cs 1110 Ch 4-1 Combinational Logic. ° Introduction Logic circuits for digital systems may be: °2°2 combinational sequential OR A combinational circuit.
1 EE24C Digital Electronics Project Theory: Sequential Logic (part 2)
EET 1131 Unit 7 Arithmetic Operations and Circuits
Building an Computer Adder. Building an Adder No matter how complex the circuit, or how complex the task being solved, at the base level, computer circuits.
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
ENGIN112 L14: Binary Adder Subtractor October 3, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 14 Binary Adders and Subtractors.
CS 105 Digital Logic Design
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Building Functions.
Lecture 3. Boolean Algebra, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Logic Design CS221 1 st Term sequential circuits Cairo University Faculty of Computers and Information.
CPSC 171 Introduction to Computer Science Boolean Logic, Gates, & Circuits.
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
CS1Q Computer Systems Lecture 9 Simon Gay. Lecture 9CS1Q Computer Systems - Simon Gay2 Addition We want to be able to do arithmetic on computers and therefore.
Copyright © Curt Hill Using Propositional Logic Several applications.
IKI a-Combinatorial Components Bobby Nazief Semester-I The materials on these slides are adopted from those in CS231’s Lecture Notes.
Discrete Mathematics CS 2610 February 19, Logic Gates: the basic elements of circuits Electronic circuits consist of so-called gates connected.
Chapter 10 (Part 2): Boolean Algebra  Logic Gates (10.3) (cont.)  Minimization of Circuits (10.4)
1 Boolean Logic & Number Systems Today: Some Announcements First Hour: Introduction to Logic –Section 1.2, 1.3 of Katz’s Textbook –In-class Activity #1.
Combinational Design, Part 3: Functional Blocks
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
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.
IT253: Computer Organization Lecture 7: Logic and Gates: Digital Design Tonga Institute of Higher Education.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.
Basic Electricity and Electronics Module Two Basic Electronics Copyright © Texas Education Agency, All rights reserved.
1 CS 151: Digital Design Chapter 4: Arithmetic Functions and Circuits 4-1,2: Iterative Combinational Circuits and Binary Adders.
Universal college of engineering & technology. .By Harsh Patel)
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
IT253: Computer Organization
1 Understand the examples again Overflow –When two positive numbers added together or a negative number subtracted from a positive number yields negative.
CS 232: Computer Architecture II Prof. Laxmikant (Sanjay) Kale.
Computer Systems 1 Fundamentals of Computing Simplifying Boolean Expressions.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Computer Architecture
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
Addition and multiplication Arithmetic is the most basic thing you can do with a computer, but it’s not as easy as you might expect! These next few lectures.
CompSci Today’s topics Computer Hardware Electric Circuits Upcoming Computer Communications ( Great Ideas Chapter 10) Reading (not in text)
Number Representation (Part 2) Computer Architecture (Fall 2006)
CPS120: Introduction to Computer Science Computer Math: Addition and Subtraction.
Simple ALU  Half adder  Full adder  Constructing 4 bits adder  ALU does several operations  General ALU structure  Timing diagram of adder  Overflow.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
Discrete Systems I Lecture 10 Adder and ALU Profs. Koike and Yukita.
Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patterson and Hennessy Text.
Programming for GCSE Topic 9.2: Circuits for Adding T eaching L ondon C omputing William Marsh School of Electronic Engineering and Computer Science Queen.
Basic Electricity and Electronics Module Two Basic Electronics Copyright © Texas Education Agency, All rights reserved.
Addition and multiplication1 Arithmetic is the most basic thing you can do with a computer, but it’s not as easy as you might expect! These next few lectures.
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.
Invitation to Computer Science, C++ Version, Fourth Edition
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Binary Addition and Subtraction
Combinational Circuits
Computer Architecture CST 250
Reference: Moris Mano 4th Edition Chapter 4
Fundamentals & Ethics of Information Systems IS 201
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.
Invitation to Computer Science, Java Version, Third Edition
Week 7: Gates and Circuits: PART II
Digital Logic.
Number Systems and Circuits for Addition
Logic Gates.
Digital Logic.
Objective - To add and subtract decimals.
DIGITAL ELECTRONICS B.SC FY
Instructor: Alexander Stoytchev
Chapter-4 Combinational Logic
XOR Function Logic Symbol  Description  Truth Table 
Adder Circuits By: Asst Lec. Basma Nazar
Presentation transcript:

CompSci Today’s topics Computer Hardware Electric Circuits Designing an Adder Upcoming Computer Communications ( Great Ideas Chapter 10) Reading (not in text)

CompSci Binary Addition (Z = X + Y)  Like Decimal, but---  Have only two symbols: 0, 1  At first, seems like two “inputs” will do X: Y: Z:  Looking at it  From right: 0+1 = 1; 1+0 = 1; 0+0 = 0; 0+1 = 1; 1+0 = 1  However, example not realistic  Must deal with possible carries  Need better example

CompSci Binary Addition (Z = X + Y) (+carry)  Let’s try C: X: Y: Z:  Must add a top row for carries to get whole picture  To add two number (by columns) takes three inputs  X, Y and C (for carry)  So, from right : = 1(carry 0); = 0(carry1); = 1(carry 0); = 0(carry 1); = 0(carry0); = 0(carry 1); = 1(carry 1); = 1(carry0); = 0 (carry 0); = 1 (carry 0)

CompSci Truth Tables for Addition  We need two 3-input truth tables  One for the resulting Sum bit  One for the resulting Carry bit Sum: XY CS

CompSci Truth Tables for Addition Carry: XY CC

CompSci The 3 bit Adder  Now have the building-blocks to put together an Adder of arbitrary size  Design in several steps (illustrated by drawings on web page) 1. Block Diagram 2. Simple Adder 3. Control Section 4. Putting it all together: The 3 Bit Adder  Will be on quizzes and/or Final Exam  Learn how to go through circuits and mark them  May encounter different circuits  E.g., a Subtracter  Same marking methods will apply