In a signed binary, the first bit (the leftmost) is reserved for the sign,
1 = negative, 0 = positive. This bit does not count when calculating the absolute value.
2. Construct the unsigned binary number.
Exclude the first bit (the leftmost), that is reserved for the sign:
0001 1111 0101 0000 = 001 1111 0101 0000
3. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
214
0 213
0 212
1 211
1 210
1 29
1 28
1 27
0 26
1 25
0 24
1 23
0 22
0 21
0 20
0
4. Multiply each bit by its corresponding power of 2 and add all the terms up.
001 1111 0101 0000(2) =
(0 × 214 + 0 × 213 + 1 × 212 + 1 × 211 + 1 × 210 + 1 × 29 + 1 × 28 + 0 × 27 + 1 × 26 + 0 × 25 + 1 × 24 + 0 × 23 + 0 × 22 + 0 × 21 + 0 × 20)(10) =
(0 + 0 + 4 096 + 2 048 + 1 024 + 512 + 256 + 0 + 64 + 0 + 16 + 0 + 0 + 0 + 0)(10) =
(4 096 + 2 048 + 1 024 + 512 + 256 + 64 + 16)(10) =
8 016(10)
5. If needed, adjust the sign of the integer number by the first digit (leftmost) of the signed binary:
0001 1111 0101 0000(2) = 8 016(10)
The number 0001 1111 0101 0000(2) converted from a signed binary (base two) and written as an integer in decimal system (base ten):
0001 1111 0101 0000(2) = 8 016(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.