How to convert a signed binary one's complement:
1100 0011 0011 1100(2)
to an integer in decimal system (in base 10)
1. Is this a positive or a negative number?
In a signed binary one's complement, first bit (the leftmost) indicates the sign,
1 = negative, 0 = positive.
1100 0011 0011 1100 is the binary representation of a negative integer, on 16 bits (2 Bytes).
2. Get the binary representation of the positive (unsigned) number:
* Run this step only if the number is negative *
Flip all the bits in the signed binary one's complement representation (reverse the digits) - replace the bits set on 1 with 0s and the bits on 0 with 1s:
!(1100 0011 0011 1100) = 0011 1100 1100 0011
3. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
215
0 214
0 213
1 212
1 211
1 210
1 29
0 28
0 27
1 26
1 25
0 24
0 23
0 22
0 21
1 20
1
4. Multiply each bit by its corresponding power of 2 and add all the terms up:
0011 1100 1100 0011(2) =
(0 × 215 + 0 × 214 + 1 × 213 + 1 × 212 + 1 × 211 + 1 × 210 + 0 × 29 + 0 × 28 + 1 × 27 + 1 × 26 + 0 × 25 + 0 × 24 + 0 × 23 + 0 × 22 + 1 × 21 + 1 × 20)(10) =
(0 + 0 + 8 192 + 4 096 + 2 048 + 1 024 + 0 + 0 + 128 + 64 + 0 + 0 + 0 + 0 + 2 + 1)(10) =
(8 192 + 4 096 + 2 048 + 1 024 + 128 + 64 + 2 + 1)(10) =
15 555(10)
5. If needed, adjust the sign of the integer number by the first digit (leftmost) of the signed binary:
1100 0011 0011 1100(2) = -15 555(10)
Conclusion:
Number 1100 0011 0011 1100(2) converted from signed binary one's complement representation to an integer in decimal system (in base 10):
1100 0011 0011 1100(2) = -15 555(10)
Spaces used to group digits: for binary, by 4; for decimal, by 3.
More operations of this kind:
Convert signed binary one's complement numbers to decimal system (base ten) integers
Entered binary number length must be: 2, 4, 8, 16, 32, or 64 - otherwise extra bits on 0 will be added in front (to the left).