1 - 101 1011 0100 - 1010 1010 1000 0000 0000 0000 0000 0000 0000 0000 0000 0010 0000 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard Converted to Decimal
1 - 101 1011 0100 - 1010 1010 1000 0000 0000 0000 0000 0000 0000 0000 0000 0010 0000: 64 bit double precision IEEE 754 binary floating point representation standard converted to decimal
What are the steps to convert
1 - 101 1011 0100 - 1010 1010 1000 0000 0000 0000 0000 0000 0000 0000 0000 0010 0000, a 64 bit double 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.
1
The next 11 bits contain the exponent:
101 1011 0100
The last 52 bits contain the mantissa:
1010 1010 1000 0000 0000 0000 0000 0000 0000 0000 0000 0010 0000
2. Convert the exponent from binary (from base 2) to decimal (in base 10).
The exponent is allways a positive integer.
101 1011 0100(2) =
1 × 210 + 0 × 29 + 1 × 28 + 1 × 27 + 0 × 26 + 1 × 25 + 1 × 24 + 0 × 23 + 1 × 22 + 0 × 21 + 0 × 20 =
1,024 + 0 + 256 + 128 + 0 + 32 + 16 + 0 + 4 + 0 + 0 =
1,024 + 256 + 128 + 32 + 16 + 4 =
1,460(10)
3. Adjust the exponent.
Subtract the excess bits: 2(11 - 1) - 1 = 1023,
that is due to the 11 bit excess/bias notation.
The exponent, adjusted = 1,460 - 1023 = 437
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).
1010 1010 1000 0000 0000 0000 0000 0000 0000 0000 0000 0010 0000(2) =
1 × 2-1 + 0 × 2-2 + 1 × 2-3 + 0 × 2-4 + 1 × 2-5 + 0 × 2-6 + 1 × 2-7 + 0 × 2-8 + 1 × 2-9 + 0 × 2-10 + 0 × 2-11 + 0 × 2-12 + 0 × 2-13 + 0 × 2-14 + 0 × 2-15 + 0 × 2-16 + 0 × 2-17 + 0 × 2-18 + 0 × 2-19 + 0 × 2-20 + 0 × 2-21 + 0 × 2-22 + 0 × 2-23 + 0 × 2-24 + 0 × 2-25 + 0 × 2-26 + 0 × 2-27 + 0 × 2-28 + 0 × 2-29 + 0 × 2-30 + 0 × 2-31 + 0 × 2-32 + 0 × 2-33 + 0 × 2-34 + 0 × 2-35 + 0 × 2-36 + 0 × 2-37 + 0 × 2-38 + 0 × 2-39 + 0 × 2-40 + 0 × 2-41 + 0 × 2-42 + 0 × 2-43 + 0 × 2-44 + 0 × 2-45 + 0 × 2-46 + 1 × 2-47 + 0 × 2-48 + 0 × 2-49 + 0 × 2-50 + 0 × 2-51 + 0 × 2-52 =
0.5 + 0 + 0.125 + 0 + 0.031 25 + 0 + 0.007 812 5 + 0 + 0.001 953 125 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0.000 000 000 000 007 105 427 357 601 001 858 711 242 675 781 25 + 0 + 0 + 0 + 0 + 0 =
0.5 + 0.125 + 0.031 25 + 0.007 812 5 + 0.001 953 125 + 0.000 000 000 000 007 105 427 357 601 001 858 711 242 675 781 25 =
0.666 015 625 000 007 105 427 357 601 001 858 711 242 675 781 25(10)
5. Put all the numbers into expression to calculate the double precision floating point decimal value:
(-1)Sign × (1 + Mantissa) × 2(Adjusted exponent) =
(-1)1 × (1 + 0.666 015 625 000 007 105 427 357 601 001 858 711 242 675 781 25) × 2437 =
-1.666 015 625 000 007 105 427 357 601 001 858 711 242 675 781 25 × 2437 = ...
= -591 271 812 271 266 290 533 493 394 015 182 185 616 386 615 515 176 409 758 418 080 354 654 742 580 327 535 839 467 917 923 186 895 542 308 988 372 120 323 316 720 118 792 192
1 - 101 1011 0100 - 1010 1010 1000 0000 0000 0000 0000 0000 0000 0000 0000 0010 0000, a 64 bit double precision IEEE 754 binary floating point representation standard to a decimal number, written in base ten (double) = -591 271 812 271 266 290 533 493 394 015 182 185 616 386 615 515 176 409 758 418 080 354 654 742 580 327 535 839 467 917 923 186 895 542 308 988 372 120 323 316 720 118 792 192(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.