Signed binary is how computers represent positive and negative whole numbers using only 0s and 1s. Converting a signed binary number to decimal means reading that pattern correctly so you know both the value and whether it is positive or negative. The method you use depends on which signed number system the binary is written in — sign-magnitude, one’s complement, or two’s complement — and two’s complement is the one you will meet most often.
What Does “Signed Binary” Actually Mean?
In plain unsigned binary, every bit helps count upward. The string 1011 means 8 + 0 + 2 + 1 = 11. There is no way to write a negative number.
Signed binary fixes that by setting aside a rule for the sign. The most common rule is to treat the leftmost bit — called the most significant bit, or MSB — as the sign indicator. If that bit is 0, the number is positive. If it is 1, the number is negative.
But here is the part that trips people up. The sign bit is not just a flag you peel off and ignore. In two’s complement, the most widely used system, that leftmost bit carries a real mathematical weight. In an 8-bit number, the leftmost bit represents −128, not +128. That single fact is the key to every conversion that follows.
There are three signed systems in common use, and they behave differently:
- Sign-magnitude: the leftmost bit is a pure sign flag; the remaining bits are the ordinary value.
- One’s complement: negative numbers are formed by flipping every bit of the positive version.
- Two’s complement: negative numbers are formed by flipping every bit and adding 1. This is what modern computers use.
How To Convert Signed Binary To Decimal Step By Step
For a two’s complement number, follow these steps in order.
Step 1 — Count the bits. The total number of bits tells you the place value of the sign bit. In an 8-bit number the sign bit is worth −128. In a 4-bit number it is worth −8. In a 16-bit number it is worth −32,768.
Step 2 — Look at the leftmost bit. If it is 0, the number is positive and you convert it exactly like ordinary binary. If it is 1, the number is negative and you keep reading.
Step 3 — Assign each bit its place value. Going from left to right, the place values halve each time, but the leftmost one is negative. For 8 bits the values are −128, 64, 32, 16, 8, 4, 2, 1.
Step 4 — Add up the place values where the bit is 1. Ignore the positions holding a 0. The total is your decimal number.
Step 5 — Check the sign. If the leftmost bit was 1, your sum should come out negative. If it comes out positive, you made an arithmetic slip.
Worked example: convert 11110110 (8-bit two’s complement).
The leftmost bit is 1, so the number is negative. The place values are −128, 64, 32, 16, 8, 4, 2, 1. The bits that are 1 sit at −128, 64, 32, 16, 4, and 2. Add them: −128 + 64 = −64; −64 + 32 = −32; −32 + 16 = −16; −16 + 4 = −12; −12 + 2 = −10. The answer is −10.
Why Does the Leftmost Bit Count as Negative?
It comes down to how addition is built into the hardware. Engineers wanted a system where subtraction could be done by adding a negative number, with no special circuitry.
In an 8-bit two’s complement system, the numbers run from −128 to 127. If you add 1 to 127 you get 10000000, which reads as −128. The counter wraps around, the same way a car odometer rolls from 999999 back to 000000. That wrap-around is not a flaw. It is the design.
Because the leftmost bit is weighted at −128, the whole system stays consistent. Positive numbers use place values 64 down to 1 and stay under 128. Negative numbers start from −128 and add smaller positive values back on. That is why 11111111 equals −1: −128 plus all the positive place values (64+32+16+8+4+2+1 = 127) gives −1.
This is the non-obvious part most beginners miss. Two’s complement is not “binary with a minus sign attached.” It is a single continuous number line where the top bit happens to be negative.
How Do You Convert Sign-Magnitude and One’s Complement?
These two systems are older and simpler, and you will still see them in textbooks and some data formats.
Sign-magnitude: strip off the leftmost bit as a sign, then read the rest as normal binary. In 8-bit sign-magnitude, 10000101 means negative (leading 1) and the remaining 0000101 equals 5, so the value is −5. The catch is that this system has two zeros: 00000000 (+0) and 10000000 (−0). That redundancy is one reason it fell out of favor.
One’s complement: if the leading bit is 0, convert normally. If it is 1, flip every bit to get the magnitude, then attach a minus sign. To convert 11111010, flip all eight bits to get 00000101, which is 5, so the value is −5. One’s complement also has two zeros, and it needs an extra correction step during arithmetic.
Two’s complement avoids both problems, which is why virtually every modern processor uses it for signed integers.
Quick Reference: The Same Bit Pattern in Three Systems
The table below shows how identical 8-bit strings produce different decimal values depending on the system. This is why you must know which convention a number uses before you convert it.
| 8-bit pattern | Sign-magnitude | One’s complement | Two’s complement |
|---|---|---|---|
| 00000101 | +5 | +5 | +5 |
| 11111010 | −122 | −5 | −6 |
| 11111011 | −123 | −4 | −5 |
| 10000000 | −0 | −127 | −128 |
| 11111111 | −127 | −0 | −1 |
Notice the bottom row. The string 11111111 means −127 in sign-magnitude, −0 in one’s complement, and −1 in two’s complement. Same bits, three different answers.
How Do You Go From Decimal Back to Signed Binary?
Working in reverse is useful for checking your answers. For two’s complement, the process depends on whether the number is positive or negative.
For a positive number, convert it to ordinary binary and pad with leading zeros to fill the bit width. The number 45 in 8 bits becomes 00101101.
For a negative number, write the positive version in binary, flip every bit, then add 1. To encode −45 in 8 bits: positive 45 is 00101101; flipping gives 11010010; adding 1 gives 11010011. Convert that back with the place-value method and you get −128 + 64 + 16 + 2 + 1 = −45. It checks out.
That flip-and-add-one trick is worth memorizing. It is the same operation in both directions, which is part of why two’s complement is so elegant.
What Are the Common Mistakes to Avoid?
Most conversion errors come from a handful of predictable places.
- Forgetting the bit width. The value of the sign bit depends on how many bits the number uses. 1010 as a 4-bit two’s complement number is −6, but as an 8-bit number it is +10.
- Treating the sign bit as a simple flag. In two’s complement it has a real negative weight. Do not just read the rest and slap on a minus sign.
- Mixing up the systems. Applying sign-magnitude rules to a two’s complement number gives wrong answers, as the table above shows.
- Dropping the sign check. If the leading bit is 1, the result must be negative. A positive answer signals an arithmetic error.
The bit-width mistake is the most common. A binary string has no meaning on its own — you always need to know how many bits it is meant to occupy.
Frequently Asked Questions
How do I convert signed binary to decimal?
Identify the bit width, then add the place values where each bit is 1, using a negative value for the leftmost bit. If that leftmost bit is 0, the number is positive and you convert it as ordinary binary.
What is the difference between signed and unsigned binary?
Unsigned binary represents only zero and positive numbers, while signed binary reserves the leftmost bit to handle negatives. Unsigned 8-bit values run from 0 to 255, and signed 8-bit two’s complement values run from −128 to 127.
Why is 11111111 equal to −1 in two’s complement?
The leftmost bit carries a weight of −128, and the remaining seven bits add up to 127. Adding −128 and 127 gives −1.
How do I know which signed binary system a number uses?
You generally cannot tell from the bits alone, because the same pattern means different things in each system. You have to know the convention in use, and modern computers almost always use two’s complement for signed integers.
