April 2006 Saeid Nooshabadi

Slides:



Advertisements
Similar presentations
COMP3221 lec19-fp-I.1 Saeid Nooshabadi COMP 3221 Microprocessors and Embedded Systems Lectures 19 : Floating Point Number Representation – I
Advertisements

Spring 2013 Advising Starts this week! CS2710 Computer Organization1.
Fixed Point Numbers The binary integer arithmetic you are used to is known by the more general term of Fixed Point arithmetic. Fixed Point means that we.
CENG536 Computer Engineering department Çankaya University.
1 IKI10230 Pengantar Organisasi Komputer Bab 6: Aritmatika 7 & 14 Mei 2003 Bobby Nazief Qonita Shahab bahan kuliah:
1 CS61C L9 Fl. Pt. © UC Regents CS61C - Machine Structures Lecture 9 - Floating Point, Part I September 27, 2000 David Patterson
COMP3221: Microprocessors and Embedded Systems Lecture 14: Floating Point Numbers Lecturer: Hui Wu Session 2, 2004.
Chapter 3 Arithmetic for Computers. Multiplication More complicated than addition accomplished via shifting and addition More time and more area Let's.
CS 61C L15 Floating Point I (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C :
CS61C L11 Floating Point I (1) Chae, Summer 2008 © UCB Albert Chae, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #11 – Floating.
CS 61C L15 Floating Point I (1) Krause, Spring 2005 © UCB This day in history… TA Danny Krause inst.eecs.berkeley.edu/~cs61c-td inst.eecs.berkeley.edu/~cs61c.
CS 61C L15 Floating Point I (1) Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
CSE 378 Floating-point1 How to represent real numbers In decimal scientific notation –sign –fraction –base (i.e., 10) to some power Most of the time, usual.
1 Module 2: Floating-Point Representation. 2 Floating Point Numbers ■ Significant x base exponent ■ Example:
CS 61C L10 Floating Point (1) A Carle, Summer 2005 © UCB inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #10: Floating Point
CS61C L15 Floating Point I (1) Jacobs, Spring 2008 © UCB TA Ordinaire Dave Jacobs inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
ECEN 248 Integer Multiplication, Number Format Adopted from Copyright 2002 David H. Albonesi and the University of Rochester.
CS61C L15 Floating Point I (1) Garcia, Fall 2006 © UCB #16 Cal rolls over OSU  Behind the arm of Nate Longshore’s 341 yds passing & 4 TDs, the Bears roll.
IT 251 Computer Organization and Architecture Introduction to Floating Point Numbers Chia-Chi Teng.
Number Systems II Prepared by Dr P Marais (Modified by D Burford)
Csci 136 Computer Architecture II – Floating-Point Arithmetic
CEN 316 Computer Organization and Design Computer Arithmetic Floating Point Dr. Mansour AL Zuair.
IT253: Computer Organization
Floating Point. Agenda  History  Basic Terms  General representation of floating point  Constructing a simple floating point representation  Floating.
Floating Point (a brief look) We need a way to represent –numbers with fractions, e.g., –very small numbers, e.g., –very large numbers,
CSC 221 Computer Organization and Assembly Language
CSCI-365 Computer Organization Lecture Note: Some slides and/or pictures in the following are adapted from: Computer Organization and Design, Patterson.
FLOATING POINT ARITHMETIC P&H Slides ECE 411 – Spring 2005.
CS 61C L3.2.1 Floating Point 1 (1) K. Meinz, Summer 2004 © UCB CS61C : Machine Structures Lecture Floating Point Kurt Meinz inst.eecs.berkeley.edu/~cs61c.
CDA 3101 Fall 2013 Introduction to Computer Organization
CS 232: Computer Architecture II Prof. Laxmikant (Sanjay) Kale Floating point arithmetic.
10/7/2004Comp 120 Fall October 7 Read 5.1 through 5.3 Register! Questions? Chapter 4 – Floating Point.
Fixed-point and floating-point numbers Ellen Spertus MCS 111 October 4, 2001.
Cosc 2150: Computer Organization Chapter 9, Part 3 Floating point numbers.
1 CE 454 Computer Architecture Lecture 4 Ahmed Ezzat The Digital Logic, Ch-3.1.
Floating Point Representations
Lecture 6. Fixed and Floating Point Numbers
Dr. Clincy Professor of CS
Introduction To Computer Science
2.4. Floating Point Numbers
Dr. Clincy Professor of CS
Lecture 9: Floating Point
Topics IEEE Floating Point Standard Rounding Floating Point Operations
Floating Point Numbers: x 10-18
CS 232: Computer Architecture II
PRESENTED BY J.SARAVANAN. Introduction: Objective: To provide hardware support for floating point arithmetic. To understand how to represent floating.
Chapter 6 Floating Point
Arithmetic for Computers
Topic 3d Representation of Real Numbers
Luddy Harrison CS433G Spring 2007
Recent from Dr. Dan Lo regarding 12/11/17 Dept Exam
ECE/CS 552: Floating Point
Number Representations
CS201 - Lecture 5 Floating Point
CS 61C: Great Ideas in Computer Architecture Floating Point Arithmetic
(Part 3-Floating Point Arithmetic)
How to represent real numbers
How to represent real numbers
Dr. Clincy Professor of CS
Hello to Robb Neuschwander listening from Louisville, KY!
October 17 Chapter 4 – Floating Point Read 5.1 through 5.3 1/16/2019
Floating Point Numbers
Recent from Dr. Dan Lo regarding 12/11/17 Dept Exam
Lecturer PSOE Dan Garcia
Topic 3d Representation of Real Numbers
CS 286 Computer Architecture & Organization
Numbers with fractions Could be done in pure binary
Number Representations
Floating Point Arithmetic
CDA 3101 Spring 2016 Introduction to Computer Organization
Presentation transcript:

April 2006 Saeid Nooshabadi saeid@unsw.edu.au ELEC2041 Microprocessors and Interfacing Lectures 19: Floating Point Number Representation – I http://webct.edtec.unsw.edu.au/ April 2006 Saeid Nooshabadi saeid@unsw.edu.au

Floating Point Numbers Motivation: Decimal Scientific Notation Overview Floating Point Numbers Motivation: Decimal Scientific Notation Binary Scientific Notation Floating Point Representation inside computer (binary) Greater range, precision IEEE-754 Standard

Computers are made to deal with numbers Review of Numbers Computers are made to deal with numbers What can we represent in N bits? Unsigned integers: 0 to 2N - 1 Signed Integers (Two’s Complement) -2(N-1) to 2(N-1) - 1

What about other numbers? Very large numbers? (seconds/century) 3,155,760,00010 (3.1557610 x 109) Very small numbers? (atomic diameter) 0.0000000110 (1.010 x 10-8) Rationals (repeating pattern) 2/3 (0.666666666. . .) Irrationals 21/2 (1.414213562373. . .) Transcendentals e (2.718...),  (3.141...) All represented in scientific notation

Scientific Notation Review fraction 02 Scientific Notation Review mantissa/significand 6.02 Exponent 23 6 Integer 6.02 x 1023 decimal point radix (base) Normalized form: no leadings 0s (exactly one digit to left of decimal point) Alternatives to representing 1/1,000,000,000 Normalized: 1.0 x 10-9 Not normalized: 0.1 x 10-8,10.0 x 10-10 How to represent 0 in Normalized form?

Interesting Properties Finite precision i.e. the number of bits in which to represent the significand and exponent is limited. Thus not all non-integer values can be represented exactly. Example: represent 1.32 as d3 d1d2.f1 x 10 (only one digit after the decimal point)

Floating Point Number Range vs Precision (#1/4) For simplicity, assume integer Representation for Significand. Represent N by d1d2d3, where d3 Case 1) N = d1d2 x 10 d2d3 Case 2) N = d1 x 10 d3 Case 3) N = d1d2 x 100

Floating Point Number Range vs Precision (#2/4) Which representation can represent the largest value? d3 Case 1) N = d1d2 x 10 9 10 N = 99 x 10 = 9.9 x 10 99 N = 9 x 10 d2d3 Case 2) N = d1 x 10 d3 Case 3) N = d1d2 x 100 9 19 N = 99 x 100 = 9.9 x 10

Floating Point Number Range vs Precision (#3/4) In which representation can the most different values be represented? All can represent the same number of different values. Two of the systems can represent an equal number of values, more than the third. #3 can represent more values than the other two. #2 can represent more values than the other two. #1 can represent more values than the other two d3 Case 1) N = d1d2 x 10 d2d3 Case 2) N = d1 x 10 Case 3) N = d1d2 x 100

Floating Point Number Range vs Precision (#4/4) In which representation can the most different values be represented? d3 Case 1) N = d1d2 x 10 99 x 10 + 1 – 9 x 9 = 910 – (9 x 9) because 0d2 x 10 = d20 x 10 when d3>0 and d2>0 d3 – 1 All can represent the same number of different values. Two of the systems can represent an equal number of values, more than the third. #3 can represent more values than the other two. #2 can represent more values than the other two. #1 can represent more values than the other two d2d3 Case 2) N = d1 x 10 9 x 100 + 1 = 901 d3 Case 3) N = d1d2 x 100 99 x 10 + 1 – 9 x 9 = 910

Scientific Notation for Binary Numbers significand exponent 1.0two x 2-1 “binary point” radix (base) Computer arithmetic that supports it is called floating point, because it represents numbers where binary point is not fixed, as it is for integers Declare such variable in C as float

Properties of a good FP Number rep. Represents many useful numbers most of the 2N possible are useful How many LARGE? How many small? Easy to do arithmetic ( +, -, *, / ) Easy to do comparison ( ==, <, > ) Nice mathematical properties A != B => A - B != 0

Floating Point Representation (#1/2) Normal format: +1.xxxxxxxxxxtwo*2yyyytwo Multiple of Word Size (32 bits) 31 S Exponent 30 23 22 Significand 1 bit 8 bits 23 bits S represents Sign Exponent represents y’s Significand represents x’s Leading 1 in Significand is implied Represent numbers as small as 2.0 x 10-38 to as large as 2.0 x 1038

Floating Point Representation (#2/2) What if result too large? (> 2.0x1038 ) Overflow! Overflow => Exponent larger than represented in 8-bit Exponent field What if result too small? (<0 x < 2.0x10-38 ) Underflow! Underflow => Negative exponent larger than represented in 8-bit Exponent field How to reduce chances of overflow or underflow?

Double Precision Fl. Pt. Representation Next Multiple of Word Size (64 bits) 31 S Exponent 30 20 19 Significand 1 bit 11 bits 20 bits Significand (cont’d) 32 bits Double Precision (vs. Single Precision) C variable declared as double Represent numbers almost as small as 2.0 x 10-308 to almost as large as 2.0 x 10308 But primary advantage is greater accuracy due to larger significand

Most low end processors do not have Ft. Pt. Coprocessors Fl. Pt. Hardware Microprocessors do floating point computation using a special coprocessor. works under the processor supervision Has its own set of registers Most low end processors do not have Ft. Pt. Coprocessors ARM processor on DSLMU board does not have Ft. Pt. Coprocessor Ft. Pt. Computation by software emulation Ft. Pt. Emulator: A student mini project on: http://dsl.ee.unsw.edu.au/unsw/projects/armvfp/README.html. (Closely mimics hardware) Some high end ARM processors do have coprocessor hardware support.

IEEE 754 Floating Point Standard (#1/6) Single Precision, (DP similar) Sign bit: 1 means negative 0 means positive Significand: To pack more bits, leading 1 implicit for normalized numbers. (Hidden Bit) 1 + 23 bits single, 1 + 52 bits double always true: 0 < Significand < 1 (for normalized numbers) What about Zero? Next Lecture

IEEE 754 Floating Point Standard (#2/6) Kahan* wanted FP numbers to be used even if no FP hardware; e.g., sort records with FP numbers using integer compares Wanted Compare to be faster, by means of a single compare operation, used for integer numbers, especially if positive FP numbers How to order 3 parts (Sign, Significand and Exponent) to simplify compare? The Author of IEEE 754 FP Standard http://www.cs.berkeley.edu/~wkahan/ ieee754status/754story.html

IEEE 754 Floating Point Standard (#3/6) How to order 3 Fields in a Word? +1.xxxxxxxxxxtwo*2yyyytwo “Natural”: Sign, Fraction, Exponent? Problem: If want to sort using integer compare operations, won’t work: 1.0 x 220 vs. 1.1 x 210 ; latter looks bigger! 0 10000 10100 0 11000 01010 Exponent, Sign, Fraction? Need to get sign first, since negative < positive Therefore order is Sign Exponent Fraction 1.0 x 1020 > 1.1 x 1010 S Exponent Significand

IEEE 754 Floating Point Standard (#4/6) Want compare Fl.Pt. numbers as if integers, to help in sort Sign first part of number Exponent next, so big exponent => bigger No. Negative Exponent? 2’s comp? 1.0 x 2-1 vs 1.0 x2+1 (1/2 vs 2) 1111 1111 000 0000 0000 0000 0000 0000 0000 0001 1/2 2 This notation using integer compare of 1/2 vs 2 makes 1/2 > 2!

IEEE 754 Floating Point Standard (#5/6) Instead, pick notation: 0000 0000 is most negative, 1111 1111 is most positive Called Biased Notation; bias subtracted to get number 127 in Single Prec. (1023 D.P.) -127 0000 0000 -126 0000 0001 ... -1 0111 1110 0 0111 1111 +1 1000 0000 ... +127 1111 1110 +128 1111 1111 2’s comp? 1.0 x 2-1 vs 1.0 x 2+1 (1/2 vs 2) This notation using integer compare of 1/2 vs 2 makes 2 look greater than 1/2 0111 1110 000 0000 0000 0000 0000 0000 1000 0000 1/2 2

IEEE 754 Floating Point Standard (#6/6) Summary (single precision): 31 S Exponent 30 23 22 Significand 1 bit 8 bits 23 bits (-1)S x (1 + Significand) x 2(Exponent-127) Double precision identical, except with exponent bias of 1023

Floating Point Number Distribution Which numbers can be represented? 1 2 3 4 5 6 7 8 -1 -2 -3 -4 -5 -6 -7 -8 1.000 x 2-1 1.000 x 2-2 1.000 x 2-3 1.001 x 22 1.010 x 22 1.011 x 22 1.100 x 22 1.101 x 22 1.110 x 22 1.111 x 22 -1.000 x 20 -1.000 x 21 -1.000 x 22 -1.000 x 23 1.000 x 20 1.000 x 21 1.000 x 22 1.000 x 23 Using mantissa of 1.000 and positive exponents and Sign bit and negative exponents in each of the intervals of exponentially increasing size can represent 2S (s=3 here) numbers of uniform difference But how do we represent 0? Next Lecture!

“And in Conclusion..” Number of digits allocated to significand and exponent, and choice of base, can affect both the number of different representable values and the range of values. Finite precision means we have to cope with roundoff error (arithmetic with inexact values) and truncation error (large values overwhelming small ones). IEEE 754 Standard allows Single Precision (1 word) and Double Precision (2-word) representation of FP. Nos.