CSE 246: Computer Arithmetic Algorithms and Hardware Design

Slides:



Advertisements
Similar presentations
EET 1131 Unit 7 Arithmetic Operations and Circuits
Advertisements

CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Winter 2004 Lecture 2.
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Lecture 6.
UNIVERSITY OF MASSACHUSETTS Dept
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Lecture 5.
CS 151 Digital Systems Design Lecture 3 More Number Systems.
Fixed-Point Arithmetics: Part I
UNIVERSITY OF MASSACHUSETTS Dept
UNIVERSITY OF MASSACHUSETTS Dept
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Winter 2004 Lecture 1.
1 Lecture 8: Binary Multiplication & Division Today’s topics:  Addition/Subtraction  Multiplication  Division Reminder: get started early on assignment.
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Winter 2005 Lecture 1: Numbers.
Chapter Chapter Goals Know the different types of numbers Describe positional notation.
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Lecture 4.
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Fall 2006 Lecture 1: Introduction and Numbers.
Copyright 2008 Koren ECE666/Koren Part.6a.1 Israel Koren Spring 2008 UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Digital Computer.
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Winter 2004 Lecture 7.
ENGIN112 L3: More Number Systems September 8, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 3 More Number Systems.
Computer ArchitectureFall 2007 © August 29, 2007 Karem Sakallah CS 447 – Computer Architecture.
Data Representation – Chapter 3 Sections 3-2, 3-3, 3-4.
FIGURES FOR CHAPTER 1 INTRODUCTION NUMBER SYSTEMS AND CONVERSION
Multiplication.
Lecture Objectives: 1)Explain the relationship between addition and subtraction with twos complement numbering systems 2)Explain the concept of numeric.
Lecture 12: Computer Arithmetic Today’s topic –Numerical representations –Addition / Subtraction –Multiplication / Division 1.
© Janice Regan, CMPT 128, Jan CMPT 128: Introduction to Computing Science for Engineering Students Integer Data representation Addition and Multiplication.
Data Representation – Binary Numbers
Conversion Between Lengths Positive number pack with leading zeros +18 = = Negative numbers pack with leading ones -18 =
Chapter 7 Arithmetic Operations and Circuits Binary Arithmetic Addition –When the sum exceeds 1, carry a 1 over to the next-more-significant column.
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.
IT253: Computer Organization
Topic: Arithmetic Circuits Course: Digital Systems Slide no. 1 Chapter # 5: Arithmetic Circuits.
07/19/2005 Arithmetic / Logic Unit – ALU Design Presentation F CSE : Introduction to Computer Architecture Slides by Gojko Babić.
Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.
CH09 Computer Arithmetic  CPU combines of ALU and Control Unit, this chapter discusses ALU The Arithmetic and Logic Unit (ALU) Number Systems Integer.
Binary Arithmetic Kuliah Sistem Digital, Teknik Elektro UMY (Rahmat Adiprasetya)
Number Representation. 10/12/2015CDA31002 Conversion between Representations Now we can represent a quantity in different number representations How can.
Sequential Multipliers Lecture 9. Required Reading Chapter 9, Basic Multiplication Scheme Chapter 10, High-Radix Multipliers Chapter 12.3, Bit-Serial.
Chapter 2 Binary Values and Number Systems. 2 2 Natural Numbers Zero and any number obtained by repeatedly adding one to it. Examples: 100, 0, 45645,
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Logic and Computer Design.
Digital Logic Design Lecture # 2 University of Tehran.
1 Lecture 6 BOOLEAN ALGEBRA and GATES Building a 32 bit processor PH 3: B.1-B.5.
Sep 29, 2004Subtraction (lvk)1 Negative Numbers and Subtraction The adders we designed can add only non-negative numbers – If we can represent negative.
1 2.1 Introduction A bit is the most basic unit of information in a computer. –It is a state of “on” or “off” in a digital circuit. –Sometimes these states.
Digital Logic Lecture 3 Binary Arithmetic By Zyad Dwekat The Hashemite University Computer Engineering Department.
Unconventional Fixed-Radix Number Systems
1 Digital Logic Design Lecture 2 More Number Systems/Complements.
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Fall 2006 Lecture 7 Division.
Recursive Architectures for 2DLNS Multiplication RESEARCH CENTRE FOR INTEGRATED MICROSYSTEMS - UNIVERSITY OF WINDSOR 11 Recursive Architectures for 2DLNS.
Two’s and one’s complement arithmetic CLOCK ARITHMETIC.
©2010 Cengage Learning SLIDES FOR CHAPTER 1 INTRODUCTION NUMBER SYSTEMS AND CONVERSION Click the mouse to move to the next page. Use the ESC key to exit.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 8 Dr. Shi Dept. of Electrical and Computer Engineering.
Computer Arthmetic Chapter Four P&H. Data Representation Why do we not encode numbers as strings of ASCII digits inside computers? What is overflow when.
1 CS 151 : Digital Design Chapter 4: Arithmetic Functions and Circuits 4-3 : Binary Subtraction.
Ch. 4 Computer Arithmetic
09/03/20161 Information Representation Two’s Complement & Binary Arithmetic.
9/23/2004Comp 120 Fall September Chapter 4 – Arithmetic and its implementation Assignments 5,6 and 7 posted to the class web page.
CSE20 Lecture 2: Number Systems: Binary Numbers, Gray Code, and Negative Numbers CK Cheng 1.
Lecture 5 Multiplication and Division
ECE/CS 552: Integer Multipliers
Unconventional Fixed-Radix Number Systems
Subtraction The arithmetic we did so far was limited to unsigned (positive) integers. Today we’ll consider negative numbers and subtraction. The main problem.
CPU Design & Computer Arithmetic
EE207: Digital Systems I, Semester I 2003/2004
UNIVERSITY OF MASSACHUSETTS Dept
Data Representation – Chapter 3
EEL 3705 / 3705L Digital Logic Design
UNIVERSITY OF MASSACHUSETTS Dept
UNIVERSITY OF MASSACHUSETTS Dept
UNIVERSITY OF MASSACHUSETTS Dept
UNIVERSITY OF MASSACHUSETTS Dept
Presentation transcript:

CSE 246: Computer Arithmetic Algorithms and Hardware Design Winter 2004 Lecture 6 Instructor: Prof. Chung-Kuan Cheng

Topics: Homework Multiplication & Booth recoding The Project CSE 246

Homework: Homework 2 recap: Need to come up with a number system different from the conventional binary system. Inventing a new number system would be ideal. Show that the number system is better than the binary system in certain aspect/s. Also, design/describe the basic operations such as addition, subtraction, and comparison. Due 02/03/2004 Homework 3: Textbook problems 4.2, 4.9, 4.11, 4.12, and 4.26 Due 02/10/2004 CSE 246

Multiplication & Booth recoding (6) (B) (6) x (5) x (5) (30) (30) 6 x 5 6 x 5 with 5 Booth recoded CSE 246

Reformulation of multiplication eliminating sign extension The above is the summation of a six digit multiplicand (the sixth digit is the sign digit) x multiplicator digits. The S1 in the first row (one without negation) is the sign extension, an arbitrary number of S1s can be added in the first row next to S1 without affecting the result. The S terms on the right turn the one’s complement representation of the above row into two’s complement. CSE 246

Reformulation of multiplication eliminating sign extension (cont.) The “formula” on the previous page with the – at the bottom replaced with the equivalent -1 0 0 0 0 0 -1 -1 -1 -1 -1 -1 CSE 246

Arbitrary sign extension -S S S S S Z4 Z3 Z2 Z1 Z0 is equivalent to -S S S S Z4 Z3 Z2 Z1 Z0 which is in turn equivalent to any of the following -S S S Z4 Z3 Z2 Z1 Z0 -S S Z4 Z3 Z2 Z1 Z0 -S Z4 Z3 Z2 Z1 Z0 which is in turn equivalent to (S – 1) Z4 Z3 Z2 Z1 Z0 the -1 in which is used to produce - on the slide before the previous -1 -1 -1 -1 -1 -1 CSE 246

Another multiplication example with Booth recoded multiplicator (22) x (19) (418) CSE 246

Same method, negative multiplicator (3) (-1) (-3) CSE 246

Essentially the same method, radix 4 CSE 246

Shortcut to multiplication by digits in {-2,-1,0,1,2} CSE 246

x {-2,-1,0,1,2} examples 0101 << 1 1010 0101 0000 000101 111011 110110 CSE 246

The project What: what is the problem? Where: where is the problem? How: how to solve the problem? We have reached the conclusion that the order above is the correct order to tackle a problem of the sort that we need to solve for the project. CSE 246

The project (cont.) * Could I solve the problem? * I could not solve the problem! * We could not solve the problem! We have reached the conclusion that since the problem we will be dealing with is in the engineering domain, we can either solve it as it’s originally stated or a redefinition of it. Unlike the scientists we have the “redefinition” degree of freedom. CSE 246

The project (cont.) For the project we may, for instance, … * Come up with a clever way to use transistors and wires to improve (an) aspect/s of performance (perhaps we can go lower than transistors by adopting a different technology) * Come up with a idea to reduce power (low power) * Use optical computing or nanotechnology (quantum, molecular) to a good end * Come up with a fault tolerant system * Come up with a system with a reconfigurable datapath * Write a survey about using nanotechnology or optical computing to improve area, power, execution speed, and etc. of a circuit. If choose to do this for the final project, must have a comprehensive understanding of the topic. CSE 246