S rawat i i t kanpur
1 / 25

S. Rawat I.I.T. Kanpur - PowerPoint PPT Presentation

  • Uploaded on

FP-NUMBERS & FP-MULTIPLIER. S. Rawat I.I.T. Kanpur. Floating-point representation. IEEE numbers are stored using a kind of scientific notation. ± mantissa * 2 exponent We can represent floating-point numbers with three binary fields: a sign bit s an exponent field e

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
Download Presentation

PowerPoint Slideshow about ' S. Rawat I.I.T. Kanpur' - mark-nicholson

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
S rawat i i t kanpur




S. Rawat

I.I.T. Kanpur

Floating point representation
Floating-point representation

  • IEEE numbers are stored using a kind of scientific notation.

    • ± mantissa * 2exponent

  • We can represent floating-point numbers with three binary fields:

    • a sign bit s

    • an exponent field e

    • and a fraction field f.

  • The IEEE 754 standard defines several different precisions.

    • Single precision numbers include an 8-bit exponent field and a 23-bit fraction, for a total of 32 bits.

    • Double precision numbers have an 11-bit exponent field and a 52-bit fraction, for a total of 64 bits.

Single precision and double precision
Single Precision and Double Precision

Single Precision (Single means One 32 Bit Reg to register)

Double Precision (Double means Two 32 Bit Reg to register)

S rawat i i t kanpur

  • The sign bit is 0 for positive numbers and 1 for negative numbers.

  • But unlike integers, IEEE values are stored in signed magnitude format.


  • The field f contains a binary fraction.

  • The actual mantissa of the floating-point value is

    (1 + f).

    • In other words, there is an implicit 1 to the left of the binary point.

    • For example, if f is 01101…, the mantissa would be 1.01101…

  • There are many ways to write a number in scientific notation, but there is always a unique normalized representation, with exactly one non-zero digit to the left of the point.

    • 0.232 * 103 = 23.2 * 101 = 2.32 * 102 = …

  • A side effect is that we get a little more precision: there are 24 bits in the mantissa, but we only need to store 23 of them.


  • The exponent field represents the exponent as a biased number.

    • It contains the actual exponent plus 127 for single precision, or the actual exponent plus 1023 in double precision.

    • This converts all single precision exponents from -127 to 127 into unsigned numbers from 0 to 254, and all double precision exponents from -1023 to 1023 into unsigned numbers from 0 to 2046

  • Two Examples shown below for single precision

    • If the exponent is 4, the e-field will be 4+127 = 131(100000112).

    • If the e-field contains 8’b01011101(9310) the actual exponent is 93-127 = 34

  • Storing a biased exponent means we can compare IEEE values as if they were signed integers.

Example ieee decimal conversion
Example IEEE-decimal conversion

  • Let’s find the decimal value of the following IEEE number.

    • 1 01111100 1100000000000000000000

  • First convert each individual field to decimal.

    • The sign bit s is 1.

    • The e field contains 01111100 = 12410.

    • The mantissa is 0.11000… = 0.7510.

  • Then just plug these decimal values of s, e and f into our formula.

    • (1 - 2s) * (1 + f) * 2e-bias

  • This gives us

    (1 - 2) * (1 + 0.75) * 2124-127 = (-1.75 * 2-3) = -0.21875.

Converting a decimal number to ieee 754
Converting a decimal number to IEEE 754

  • What is the single-precision representation of 347.625?

    • First convert the number to binary:

    • That is 347.625 = 101011011.1012

    • Normalize the number by shifting the binary point until there is a single 1 to the left:

    • 101011011.101 x 20 = 1.01011011101 x 28

  • The bits to the right of the binary point comprise the fractional field f.

  • The number of times you shifted gives the exponent. The field-e should contain: exponent + 127.

  • Sign bit: 0 if positive, 1 if negative.

S rawat i i t kanpur

MULTIPLIER Point Representation

Fp multiplier
FP MULTIPLIER Point Representation

  • Given two FP numbers n1 and n2, the product of both denoted as n, can be expressed as

Dadda Tree (24 Bits x 24 Bits)

XOR sign Bits

Fp mult algorithm
FP-Mult-Algorithm Point Representation

Exponent in fp multiplication
Exponent in FP-Multiplication Point Representation

Adding a carry-in to the sum and subtracting 128,

which can be done by complementing the most significant bit.

Fp multiplier1
FP-Multiplier Point Representation

FP Multiplier Block Diagram

Dadda tree

DADDA TREE: Multiplication of 24 Bits x24 Bits (For FP-Significands).

(1) An array created of ANDing each bit of one operand with evry single bit of other operand (576 dots).

Dadda Tree

Dadda tree contd
Dadda Tree(contd.) FP-Significands).

Dadda tree contd1
Dadda Tree(contd.) FP-Significands).

S rawat i i t kanpur

Dadda Tree(contd.) FP-Significands).

Dadda tree contd2
Dadda Tree(contd.) FP-Significands).

Do the Reductions 96432

After 2 rows reduction ADD using 47-Bit CLA,

Note: you can instantiate CLAs written in previous labs

Result will be of 48 Bits

Fp multiplier contd
FP-Multiplier (contd.) FP-Significands).

  • A 48-bit dadda multiplier is used for the significand multiplication,

  • The 28 most significant bits (MSB) are selected as the tentative result,

    • where 24 bits are the mantissa result,

    • 1 bit is used for range overflow

    • and 3 extra bits are used for proper rounding.

  • Next, the result is normalized to the [1, 2) range,

  • Rounded for proper approximation to the closest value and normalized again.

  • The resulting sign, exponent and significand are then packed in single precision format.

  • The normalization consists in a possible single bit right shift and corresponding exponent increment, based on the value of the b1 bit.

  • The rounding scheme used is round to nearest, which can be easily achieved verifying the values of the remaining least significant bits (LSB).

Fp multiplier contd1
FP-Multiplier (contd.) FP-Significands).

Cases possible:

While feeding in Dadda tree two 24 bits operands

If (both are denormalized)


Else if (one denormalized and another normal)

MULTIPLICATION[47][46]= ‘00’ or ‘01’

Else if (both normalized)


MULTIPLICATION[47][46]=’10’(normalization required)

MULTIPLICATION[47][46]=’11’(normalization required)

An example
An Example FP-Significands).

Lets Multiply 1.5x210 & 1.25x210

Stored Bias will be 10 + 127 = 137,

So 137 + 137 = 274

Stored Exponent of the result must correspond to 20 which is 147.

As in hardware what we are doing is subtracting 127 from the added exponents which were stored in FP registers i.e. 274-127 = 147

S rawat i i t kanpur

An Example (contd.) FP-Significands).

S rawat i i t kanpur

Thanks FP-Significands).