1. Is this a positive or a negative number?
1110 1001 1111 1101 is the binary representation of a negative integer, on 16 bits (2 Bytes).
In a signed binary in two's complement representation, the first bit (the leftmost) indicates the sign, 1 = negative, 0 = positive.
2. Get the binary representation in one's complement.
* Run this step only if the number is negative *
Note on binary subtraction rules:
11 - 1 = 10; 10 - 1 = 1; 1 - 0 = 1; 1 - 1 = 0.
Subtract 1 from the initial binary number.
1110 1001 1111 1101 - 1 = 1110 1001 1111 1100
3. Get the binary representation of the positive (unsigned) number.
* Run this step only if the number is negative *
Flip all the bits of the signed binary in one's complement representation (reverse the digits) - replace the bits set on 1 with 0s and the bits on 0 with 1s:
!(1110 1001 1111 1100) = 0001 0110 0000 0011
4. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
215
0 214
0 213
0 212
1 211
0 210
1 29
1 28
0 27
0 26
0 25
0 24
0 23
0 22
0 21
1 20
1
5. Multiply each bit by its corresponding power of 2 and add all the terms up.
0001 0110 0000 0011(2) =
(0 × 215 + 0 × 214 + 0 × 213 + 1 × 212 + 0 × 211 + 1 × 210 + 1 × 29 + 0 × 28 + 0 × 27 + 0 × 26 + 0 × 25 + 0 × 24 + 0 × 23 + 0 × 22 + 1 × 21 + 1 × 20)(10) =
(0 + 0 + 0 + 4 096 + 0 + 1 024 + 512 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 2 + 1)(10) =
(4 096 + 1 024 + 512 + 2 + 1)(10) =
5 635(10)
6. If needed, adjust the sign of the integer number by the first digit (leftmost) of the signed binary:
1110 1001 1111 1101(2) = -5 635(10)
The signed binary number in two's complement representation 1110 1001 1111 1101(2) converted and written as an integer in decimal system (base ten):
1110 1001 1111 1101(2) = -5 635(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.