Differences between revisions 1 and 2
Revision 1 as of 2004-02-20 00:29:26
Size: 472
Editor: yakko
Comment:
Revision 2 as of 2004-02-20 00:32:47
Size: 742
Editor: yakko
Comment:
Deletions are marked like this. Additions are marked like this.
Line 8: Line 8:
We note that the ''Significand'' is really 1.significand * 2^Exponent which doesn't allow us to represent 0. To allow this if all bits are 0, the number is 0. We note that the ''Significand'' is really 1.significand * 2^Exponent which doesn't allow us to represent 0. To allow this if all bits are 0, the number is 0. Also the value stored in the exponent field is really the exponent + 127. This '''exponential bias''' allows floating point numbers to be sorted like a regular number +/- is most important, exponent next most important, '''mantissa'''/'''significand''' least important.

Back to ComputerTerms

Float Number format:

31

30 - 23

22 - 0

Sign Bit 0+, 1-

Value = Exponent + 127

Significand

We note that the Significand is really 1.significand * 2^Exponent which doesn't allow us to represent 0. To allow this if all bits are 0, the number is 0. Also the value stored in the exponent field is really the exponent + 127. This exponential bias allows floating point numbers to be sorted like a regular number +/- is most important, exponent next most important, mantissa/significand least important.

Thus the numbers will be:

0

127

0

In Binary this will look like this:

0

00001111111

00000000000000000000

Back to ComputerTerms

FloatingPointRepresentation (last edited 2004-02-20 01:12:49 by yakko)