What are the steps to convert
0 - 0100 1010 - 101 0011 0001 1001 1000 0000, a 32 bit single precision IEEE 754 binary floating point representation standard to decimal?
1. Identify the elements that make up the binary representation of the number:
The first bit (the leftmost) indicates the sign,
1 = negative, 0 = positive.
0
The next 8 bits contain the exponent:
0100 1010
The last 23 bits contain the mantissa:
101 0011 0001 1001 1000 0000
2. Convert the exponent from binary (from base 2) to decimal (in base 10).
The exponent is allways a positive integer.
0100 1010(2) =
0 × 27 + 1 × 26 + 0 × 25 + 0 × 24 + 1 × 23 + 0 × 22 + 1 × 21 + 0 × 20 =
0 + 64 + 0 + 0 + 8 + 0 + 2 + 0 =
64 + 8 + 2 =
74(10)
3. Adjust the exponent.
Subtract the excess bits: 2(8 - 1) - 1 = 127,
that is due to the 8 bit excess/bias notation.
The exponent, adjusted = 74 - 127 = -53
4. Convert the mantissa from binary (from base 2) to decimal (in base 10).
The mantissa represents the fractional part of the number (what comes after the whole part of the number, separated from it by a comma).
101 0011 0001 1001 1000 0000(2) =
1 × 2-1 + 0 × 2-2 + 1 × 2-3 + 0 × 2-4 + 0 × 2-5 + 1 × 2-6 + 1 × 2-7 + 0 × 2-8 + 0 × 2-9 + 0 × 2-10 + 1 × 2-11 + 1 × 2-12 + 0 × 2-13 + 0 × 2-14 + 1 × 2-15 + 1 × 2-16 + 0 × 2-17 + 0 × 2-18 + 0 × 2-19 + 0 × 2-20 + 0 × 2-21 + 0 × 2-22 + 0 × 2-23 =
0.5 + 0 + 0.125 + 0 + 0 + 0.015 625 + 0.007 812 5 + 0 + 0 + 0 + 0.000 488 281 25 + 0.000 244 140 625 + 0 + 0 + 0.000 030 517 578 125 + 0.000 015 258 789 062 5 + 0 + 0 + 0 + 0 + 0 + 0 + 0 =
0.5 + 0.125 + 0.015 625 + 0.007 812 5 + 0.000 488 281 25 + 0.000 244 140 625 + 0.000 030 517 578 125 + 0.000 015 258 789 062 5 =
0.649 215 698 242 187 5(10)
= 0.000 000 000 000 000 183 099 724 076 173 087 095 03
0 - 0100 1010 - 101 0011 0001 1001 1000 0000, a 32 bit single precision IEEE 754 binary floating point representation standard to a decimal number, written in base ten (float) = 0.000 000 000 000 000 183 099 724 076 173 087 095 03(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.