1. Is this a positive or a negative number?
1111 0101 0010 1110 is the binary representation of a negative integer, on 16 bits (2 Bytes).
In a signed binary in one's complement representation, the first bit (the leftmost) indicates the sign, 1 = negative, 0 = positive.
2. 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:
!(1111 0101 0010 1110) = 0000 1010 1101 0001
3. 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
0 211
1 210
0 29
1 28
0 27
1 26
1 25
0 24
1 23
0 22
0 21
0 20
1
4. Multiply each bit by its corresponding power of 2 and add all the terms up.
0000 1010 1101 0001(2) =
(0 × 215 + 0 × 214 + 0 × 213 + 0 × 212 + 1 × 211 + 0 × 210 + 1 × 29 + 0 × 28 + 1 × 27 + 1 × 26 + 0 × 25 + 1 × 24 + 0 × 23 + 0 × 22 + 0 × 21 + 1 × 20)(10) =
(0 + 0 + 0 + 0 + 2 048 + 0 + 512 + 0 + 128 + 64 + 0 + 16 + 0 + 0 + 0 + 1)(10) =
(2 048 + 512 + 128 + 64 + 16 + 1)(10) =
2 769(10)
5. If needed, adjust the sign of the integer number by the first digit (leftmost) of the signed binary:
1111 0101 0010 1110(2) = -2 769(10)
The signed binary number in one's complement representation 1111 0101 0010 1110(2) converted and written as an integer in decimal system (base ten):
1111 0101 0010 1110(2) = -2 769(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.