Divide the number repeatedly by 2.

- division = quotient +
**remainder**; - 27 ÷ 2 = 13 +
**1**; - 13 ÷ 2 = 6 +
**1**; - 6 ÷ 2 = 3 +
**0**; - 3 ÷ 2 = 1 +
**1**; - 1 ÷ 2 = 0 +
**1**;

- #) multiplying =
**integer**+ fractional part; - 1) 0.621 × 2 =
**1**+ 0.242; - 2) 0.242 × 2 =
**0**+ 0.484; - 3) 0.484 × 2 =
**0**+ 0.968; - 4) 0.968 × 2 =
**1**+ 0.936; - 5) 0.936 × 2 =
**1**+ 0.872; - 6) 0.872 × 2 =
**1**+ 0.744; - 7) 0.744 × 2 =
**1**+ 0.488; - 8) 0.488 × 2 =
**0**+ 0.976; - 9) 0.976 × 2 =
**1**+ 0.952; - 10) 0.952 × 2 =
**1**+ 0.904; - 11) 0.904 × 2 =
**1**+ 0.808; - 12) 0.808 × 2 =
**1**+ 0.616; - 13) 0.616 × 2 =
**1**+ 0.232; - 14) 0.232 × 2 =
**0**+ 0.464; - 15) 0.464 × 2 =
**0**+ 0.928; - 16) 0.928 × 2 =
**1**+ 0.856; - 17) 0.856 × 2 =
**1**+ 0.712; - 18) 0.712 × 2 =
**1**+ 0.424; - 19) 0.424 × 2 =
**0**+ 0.848; - 20) 0.848 × 2 =
**1**+ 0.696; - 21) 0.696 × 2 =
**1**+ 0.392; - 22) 0.392 × 2 =
**0**+ 0.784; - 23) 0.784 × 2 =
**1**+ 0.568; - 24) 0.568 × 2 =
**1**+ 0.136;

1.1011 1001 1110 1111 1001 1101 1011

- division = quotient +
**remainder**; - 131 ÷ 2 = 65 +
**1**; - 65 ÷ 2 = 32 +
**1**; - 32 ÷ 2 = 16 +
**0**; - 16 ÷ 2 = 8 +
**0**; - 8 ÷ 2 = 4 +
**0**; - 4 ÷ 2 = 2 +
**0**; - 2 ÷ 2 = 1 +
**0**; - 1 ÷ 2 = 0 +
**1**;

1 (a negative number)

1000 0011

101 1100 1111 0111 1100 1110

1 - 1000 0011 - 101 1100 1111 0111 1100 1110

#### Sign (1 bit):

1

31

#### Exponent (8 bits):

1

300

290

280

270

260

251

241

23

#### Mantissa (23 bits):

1

220

211

201

191

180

170

161

151

141

131

120

111

101

91

81

71

60

50

41

31

21

10

0

- 1. If the number to be converted is negative, start with its the positive version.
- 2. First convert the integer part. Divide repeatedly by 2 the base ten positive representation of the integer number that is to be converted to binary, until we get a quotient that is equal to zero, keeping track of each remainder.
- 3. Construct the base 2 representation of the positive integer part of the number, by taking all the remainders of the previous dividing operations, starting from the bottom of the list constructed above. Thus, the last remainder of the divisions becomes the first symbol (the leftmost) of the base two number, while the first remainder becomes the last symbol (the rightmost).
- 4. Then convert the fractional part. Multiply the number repeatedly by 2, until we get a fractional part that is equal to zero, keeping track of each integer part of the results.
- 5. Construct the base 2 representation of the fractional part of the number by taking all the integer parts of the previous multiplying operations, starting from the top of the constructed list above (they should appear in the binary representation, from left to right, in the order they have been calculated).
- 6. Normalize the binary representation of the number, by shifting the decimal point (or if you prefer, the decimal mark) "n" positions either to the left or to the right, so that only one non zero digit remains to the left of the decimal point.
- 7. Adjust the exponent in 8 bit excess/bias notation and then convert it from decimal (base 10) to 8 bit binary, by using the same technique of repeatedly dividing by 2, as shown above:

Exponent (adjusted) = Exponent (unadjusted) + 2^{(8-1)}- 1 - 8. Normalize mantissa, remove the leading (leftmost) bit, since it's allways '1' (and the decimal sign if the case) and adjust its length to 23 bits, either by removing the excess bits from the right (losing precision...) or by adding extra '0' bits to the right.
- 9. Sign (it takes 1 bit) is either 1 for a negative or 0 for a positive number.

- 1. Start with the positive version of the number:
|-25.347| = 25.347

- 2. First convert the integer part, 25. Divide it repeatedly by 2, keeping track of each remainder, until we get a quotient that is equal to zero:
- division = quotient +
**remainder**; - 25 ÷ 2 = 12 +
**1**; - 12 ÷ 2 = 6 +
**0**; - 6 ÷ 2 = 3 +
**0**; - 3 ÷ 2 = 1 +
**1**; - 1 ÷ 2 = 0 +
**1**; - We have encountered a quotient that is ZERO => FULL STOP

- division = quotient +
- 3. Construct the base 2 representation of the integer part of the number by taking all the remainders of the previous dividing operations, starting from the bottom of the list constructed above:
25

_{(10)}= 1 1001_{(2)} - 4. Then convert the fractional part, 0.347. Multiply repeatedly by 2, keeping track of each integer part of the results, until we get a fractional part that is equal to zero:
- #) multiplying =
**integer**+ fractional part; - 1) 0.347 × 2 =
**0**+ 0.694; - 2) 0.694 × 2 =
**1**+ 0.388; - 3) 0.388 × 2 =
**0**+ 0.776; - 4) 0.776 × 2 =
**1**+ 0.552; - 5) 0.552 × 2 =
**1**+ 0.104; - 6) 0.104 × 2 =
**0**+ 0.208; - 7) 0.208 × 2 =
**0**+ 0.416; - 8) 0.416 × 2 =
**0**+ 0.832; - 9) 0.832 × 2 =
**1**+ 0.664; - 10) 0.664 × 2 =
**1**+ 0.328; - 11) 0.328 × 2 =
**0**+ 0.656; - 12) 0.656 × 2 =
**1**+ 0.312; - 13) 0.312 × 2 =
**0**+ 0.624; - 14) 0.624 × 2 =
**1**+ 0.248; - 15) 0.248 × 2 =
**0**+ 0.496; - 16) 0.496 × 2 =
**0**+ 0.992; - 17) 0.992 × 2 =
**1**+ 0.984; - 18) 0.984 × 2 =
**1**+ 0.968; - 19) 0.968 × 2 =
**1**+ 0.936; - 20) 0.936 × 2 =
**1**+ 0.872; - 21) 0.872 × 2 =
**1**+ 0.744; - 22) 0.744 × 2 =
**1**+ 0.488; - 23) 0.488 × 2 =
**0**+ 0.976; - 24) 0.976 × 2 =
**1**+ 0.952; - We didn't get any fractional part that was equal to zero. But we had enough iterations (over Mantissa limit = 23) and at least one integer part that was different from zero => FULL STOP (losing precision...).

- #) multiplying =
- 5. Construct the base 2 representation of the fractional part of the number, by taking all the integer parts of the previous multiplying operations, starting from the top of the constructed list above:
0.347

_{(10)}= 0.0101 1000 1101 0100 1111 1101_{(2)} - 6. Summarizing - the positive number before normalization:
25.347

_{(10)}= 1 1001.0101 1000 1101 0100 1111 1101_{(2)} - 7. Normalize the binary representation of the number, shifting the decimal point 4 positions to the left so that only one non-zero digit stays to the left of the decimal point:
25.347

_{(10)}=

1 1001.0101 1000 1101 0100 1111 1101_{(2)}=

1 1001.0101 1000 1101 0100 1111 1101_{(2)}× 2^{0}=

1.1001 0101 1000 1101 0100 1111 1101_{(2)}× 2^{4} - 8. Up to this moment, there are the following elements that would feed into the 32 bit single precision IEEE 754 binary floating point:
Sign: 1 (a negative number)

Exponent (unadjusted): 4

Mantissa (not-normalized): 1.1001 0101 1000 1101 0100 1111 1101

- 9. Adjust the exponent in 8 bit excess/bias notation and then convert it from decimal (base 10) to 8 bit binary (base 2), by using the same technique of repeatedly dividing it by 2, as already demonstrated above:
Exponent (adjusted) = Exponent (unadjusted) + 2

^{(8-1)}- 1 = (4 + 127)_{(10)}= 131_{(10)}=

1000 0011_{(2)} - 10. Normalize the mantissa, remove the leading (leftmost) bit, since it's allways '1' (and the decimal point) and adjust its length to 23 bits, by removing the excess bits from the right (losing precision...):
Mantissa (not-normalized): 1.1001 0101 1000 1101 0100 1111 1101

Mantissa (normalized): 100 1010 1100 0110 1010 0111

- Conclusion:
Sign (1 bit) = 1 (a negative number)

Exponent (8 bits) = 1000 0011

Mantissa (23 bits) = 100 1010 1100 0110 1010 0111

#### Number -25.347, converted from the decimal system (base 10) to 32 bit single precision IEEE 754 binary floating point =

#### 1 - 1000 0011 - 100 1010 1100 0110 1010 0111

### 1.1. Unsigned integer -> Unsigned binary

### 1.2. Signed integer -> Signed binary

### 1.3. Signed integer -> Signed binary one's complement

### 1.4. Signed integer -> Signed binary two's complement

### 2.1. Decimal -> 32bit single precision IEEE 754 binary floating point

### 2.2. Decimal -> 64bit double precision IEEE 754 binary floating point

### 3.1. Unsigned binary -> Unsigned integer

### 3.2. Signed binary -> Signed integer

### 3.3. Signed binary one's complement -> Signed integer

### 3.4. Signed binary two's complement -> Signed integer