CSE111 Spring 2008 H.

Kershner

Binary Arithmetic -- Negative numbers and Subtraction

Binary Mathematics

Addition: this is performed using the same rules as decimal except all numbers are limited to
combinations of zeros (0) and ones (1).

Using 8-bit numbers

1 11
0000 11102 which is 1410
+ 0000 01102 which is + 610
-------------------- -----------
0001 01002 2010

0001 01002 => we can ignore the leading zeros, since they have no impact on our conversion

0001 01002 = 1x24 + 0x23 + 1x22 + 0x21 + 0x20

= 16 + 0 + 4 + 0 + 0
= 2010

What about negative numbers? Clearly not all numbers are positive.

What if we wanted to do: 1410 + ( -610) = 810

Recall that adding a negative number is the equivalent to subtracting a positive number.

So, : 1410 + ( -610) = 810 Î 1410 - ( +610) = 810

Subtraction: Use standard subtraction rules

0000 11102 which is 1410

- 0000 01102 which is - 610
-------------------- -----------
0000 10002 810

0000 10002 = 1x23 + 0x22 + 0x21 + 0x20 = 810

This is rather straightforward.

Try this example:

1
0 10 10 10
0001 10012 Æ 2510
- 0000 11102 Æ - 1410
-------------------- -----------
0000 10112 1110
THIS WAS PAINFUL!
Because there is so much borrowing, this is highly error prone for people.

Copyright © 2008 by Helene G. Kershner

CSE111 Spring 2008 H. Kershner

For a computer to solve this math problem using standard subtraction rules, not only is circuitry needed to
deal with the subtraction, but additional circuitry would be needed to deal with all the complex borrowing.

Early Computer Scientists and Computer Engineers looked at this and determined that building this
complex circuitry would be expensive and the calculations would be slow, even in computer time,
because of all the borrowing.

An alternative technique was developed that enabled computer hardware to work with signed numbers
using slightly modified addition hardware. This technique is called two’s complement arithmetic.

Two’s Complement

Two’s complement is a way of representing negative numbers so that only addition hardware is required
by the computer.

Step 1: Decide how many bits you are going to use for all your operations.

For example: if we use 4-bits, this leaves only 3 bits to hold the number.
This limits our numbers to only very small ones.

A 4-bit number would look like XXXX the left-most bit is considered the sign bit
|
This is the sign bit

If we were using 8-bits the left-most bit will contain the sign. This would leave 7 bits to hold the number.

XXXX XXXX
|
This is the sign bit

This sign bit is reserved and is no longer one of the digits that make up the binary number. If the sign bit
is zero (0) the binary number following it is positive. If the sign bit is one (1) the binary number following it
is negative.

In the binary number

0000 10112 the sign bit is 0 so the number is positive

The binary number is only 7-digits long,

0000 10112 = 1x23 + 0x22 + 1x21 + 1x20

8 + 0 + 2 + 1 = 1110

Note: An easier notation for converting binary to decimal

0000 1 0 1 12
(8) (2) (1) = 8 + 2 + 1 = 1110

This is exactly the same as writing out the powers of two, but we only need to remember the
values (which are all multiples of two) and can get more quickly to the end result.

Copyright © 2008 by Helene G. Kershner

CSE111 Spring 2008 H. Kershner

In the binary number

1000 11002 the sign bit is 1 so the number is negative

The binary number is only 7-digits long,

1000 1 1 0 02
(8) (4) = 8 + 4 = 1210

Remember, Step 1, was determine the number of bits being used.

For our example we will use 8 bits.

Example:
1410 - 610 = 1410 + (- 610) = 810

0000 11102 + 1000 01102 = ?2

| |
left-most digit is 0 left-most digit is 1, number is negative
number is positive

Step 2: Find the two’s complement of the negative number.

Let’s use the number -6. How do we find the two’s complement of -6?

Write down the number with

the sign bit set to zero(0) ------- 0000 01102
a) Flip all the digits
The 1 Æ 0, the 0 Æ 1 1111 10012
b) Add 1 to this number +1
--------------------------
c) This is now - 6 in the 1111 10102
two’s complement format

Step 3: Add the two’s complement in place of the negative number.

So, 1410 0000 11102

+ (-610) +1111 10102 in two’s complement format
--------------------- ------------------
810 1 0000 1000
|
| this is the positive number 8 in binary
Overflow bit
IGNORE
IT Worked!

Copyright © 2008 by Helene G. Kershner

CSE111 Spring 2008 H. Kershner

Example I:

1210 - 910 = 310

Or

1210 + (-910) = 310

0000 11002 + 1000 10012 = ?2

Positive 12 Negative 9

Step 1: Determine the number of bits we are using. Choose 8 bits

1210 = 0000 11002

- 910 = 1000 10012

Step 2: Determine the 2’s complement of the negative number, or the number to be subtracted.

Find the 2’s complement of 910

Write down the number 0000 10012

with the sign bit set to zero(0)
A) Flip all the digits 1111 01102 this is the 1’s complement
0Æ 1, 1Æ 0
B) Add One(1) + 1
-------------------------
C) This is Two’s Complement 1111 01112 Note: left-most bit is 1, negative number

Step 3: Add the numbers together. In this case, add 1210 in binary (0000 11002) and the two’s
complement of - 910 in binary (1111 0111). Ignore any overflow.

1 11 1 1
1210 0000 11002
+ (-910) + 1111 01112
-------------- ------------------------
310 1 0000 00112
|
| this is the positive number 3 in binary
IGNORE
Overflow

IT Worked!

Copyright © 2008 by Helene G. Kershner

CSE111 Spring 2008 H. Kershner

Example II:
2510 - 1410 = 1110

Or

2510 + (-1410) = 1110

0001 10012 + 1000 11102 = 0000 1011

Positive 25 Negative 14 Positive 11

Step 1: Determine the number of bits we are using. Choose 8 bits

2510 = 0001 10012

Positive 1410 = 0000 11102

Step 2: Determine the 2’s complement of the negative number, or the number to be subtracted.

Find the 2’s complement of 910

Write down the number 0000 11102

With the sign bit set to zero(0)
A) Flip all the digits 1111 00012 this is the 1’s complement
0Æ 1, 1Æ 0
B) Add One(1) + 1
-------------------------
C) This is the Two’s Complement 1111 00102 Note: left-most bit is 1, negative number
form of – 9

Step 3: Add the numbers together. In this case, add 1210 in binary (0000 11002) and the two’s
complement of 910 in binary (1111 0111). Ignore any overflow.

1 11
2510 0001 10012
+ (-1410) + 1111 00102
-------------- ------------------------
1110 1 0000 10112
|
| this is the positive number 3 in binary
IGNORE
Overflow

IT Worked!

In all of the above examples, the resulting number, the answer was positive.

Copyright © 2008 by Helene G. Kershner

CSE111 Spring 2008 H. Kershner

What happens if we are working with numbers where the result is negative?

The basic computational process is the same. Negative numbers are converted to their two’s
complement equivalent. But since the resulting number is negative, rather than positive, twos
complement is used again to convert the number back to standard binary.

Example III:

910 - 1410 = 910 + (-1410) = -5

Decimal Standard Binary
910 0000 10012 left-most digit says positive
+ (-1410) + 1000 11102 left-most digit says negative
------------- --------------------------------
- 510

Step 1: Decide on the number of binary digits -- Choose 8

Step 2: Convert the negative number to it’s twos complement equivalent.

Write down the negative number 0000 11102

with sign bit set to 0
A) Flip the digits 1111 00012
B) Add one (1) + 1
------------------------
C) This is two’s complement 1111 00102

Step 3: Add the two numbers together.

910 0000 10012

+ (-1410) + 1111 00102 in two’s complement format
------------- --------------------------------
1111 10112 no overflow, this says result
Is still in two’s complement form

Step 4: Convert from two’s complement by doing the two’s complement process again.

Write down the number 1111 10112

A) Flip the digits 0000 01002
B) Add one (1) + 1
------------------------
C) This is two’s complement 0000 01012 positive 5, in standard binary
D) We know the result
Is negative, change sign bit 1000 01012 negative 5, in standard binary

Copyright © 2008 by Helene G. Kershner

CSE111 Spring 2008 H. Kershner

Example IV:

- 25 + 18 = - 7
Proceed the same way, converting the negative number to it’s two’s complement equivalent.

Decimal Standard Binary

- 2510 1001 10012 left-most digit says negative
+ 1810 + 0001 00102 left-most digit says positive
------------- --------------------------------
- 710

Step 1: Decide on the number of binary digits -- Choose 8

Step 2: Convert the negative number to it’s twos complement equivalent.

Write down the negative number 0001 10012

with sign bit 0

A) Flip the digits 1110 01102

B) Add one (1) + 1
------------------------
C) This is two’s complement 1110 01112

Step 3: Add the two numbers together.

- 2510 1110 01112 in two’s complement format

+ 1810 + 0001 00102
------------- --------------------------------
1111 10012 no overflow, this says result
Is still in two’s complement form

Step 4: Convert from two’s complement by doing the two’s complement process again.

Write down the number 1111 10012

A) Flip the digits 0000 01102
B) Add one (1) + 1
------------------------
C) This is two’s complement 0000 01112 positive 7, in standard binary
D) We know the result
Is negative, change sign bit 1000 11102 negative 7, in standard binary

Copyright © 2008 by Helene G. Kershner

CSE111 Spring 2008 H. Kershner

Try these problems:

1) 910 - 710 = 210 0000 1001 - 0000 0111 =

2) 1710 - 1210 = 510 0001 0001 - 0000 1100 =

3) 1810 - 2210 = - 410 0001 0010 - 0001 0110 =

4) 710 - 1910 = - 1210 0000 0111 - 0001 0011 =

5) - 2610 + 1010 = - 1610 1001 1010 + 0000 1010 =

6) - 1910 + 610 = - 1310 1001 0011 + 0000 0110 =

Copyright © 2008 by Helene G. Kershner

CSE111 Spring 2008 H. Kershner

Solutions:

1) 910 - 710 = 210 0000 1001 - 0000 0111 =

This is the same as
910 + (-710) = 210 0000 1001 + 1000 0111 =

Convert the negative number to it’s 2’s complement equivalent

1000 0111 Æ start with sign bit 0 0000 0111

Flip the digits 1111 1000
+ 1
-----------------------
This is 2’s comp 1111 1001

Now add the numbers

0000 1001
+ 1111 1001
-------------------------------
1 0000 0010
= 210

2) 1710 - 1210 = 510 0001 0001 - 0000 1100 =

This is the same as
1710 + (-1210) = 510 0001 0001 + 1000 1100 =
Convert the negative number to it’s 2’s complement equivalent

1000 1100 Æ start with sign bit 0 0000 1100

Flip the digits 1111 0011
+ 1
-----------------------
This is 2’s comp 1111 0100

Now add the numbers

0001 0001
+ 1111 0100
-------------------------------
1 0000 0101
= 510

Copyright © 2008 by Helene G. Kershner

CSE111 Spring 2008 H. Kershner

3) 1810 - 2210 = - 410 0001 0010 - 0001 0110 =

This is the same as
1810 + (-2210) = - 410 0001 0010 + 1001 0110 =
Convert the negative number to it’s 2’s complement equivalent

1001 0110 Æ start with sign bit 0 0001 0110

Flip the digits 1110 1001
Add one(1) + 1
-----------------------
This is 2’s comp 1110 1010

Now add the numbers

0001 0010
+ 1110 1010
-------------------------------
1111 1100
No Overflow
This is still in 2’s complement
Apply 2’s complement to number again

1110 1010 Æ Start with sign bit 0 0111 1100

Flip the digits 1000 0011
Add one(1) + 1
--------------------------------
1000 0100

- 410

4) 710 - 1910 = - 1210 0000 0111 - 0001 0011 =

This is the same as
710 + (-1910) = - 1210 0000 0111 + 1001 0011 =
Convert the negative number to it’s 2’s complement equivalent

Copyright © 2008 by Helene G. Kershner

CSE111 Spring 2008 H. Kershner

1001 0011 Æ start with sign bit 0 0001 0011

Flip the digits 1110 1100
Add one(1) + 1
-----------------------
This is 2’s comp 1110 1101

Now add the numbers

0000 0111
+ 1110 1101
-------------------------------
1111 0100
No Overflow
This is still in 2’s complement
Apply 2’s complement to number again

1111 0100 Æ Start with sign bit 0 0111 0100

Flip the digits 1000 1011
Add one(1) + 1
--------------------------------
1000 1100

- 1210

5) - 2610 + 1010 = - 1610 1001 1010 + 0000 1010 =

Convert the negative number to it’s 2’s complement equivalent

1001 1010 Æ start with sign bit 0 0001 1010

Flip the digits 1110 0101
Add one(1) + 1
-----------------------
This is 2’s comp 1110 0110

Now add the numbers

1110 0110
+ 0000 1010
-------------------------------
1111 0000
No Overflow
This is still in 2’s complement

Copyright © 2008 by Helene G. Kershner

CSE111 Spring 2008 H. Kershner

Apply 2’s complement to number again

1111 0000 Æ Start with sign bit 0 0111 0000

Flip the digits 1000 1111
Add one(1) + 1
--------------------------------
1001 0000

- 1610

6) - 1910 + 610 = - 1310 1001 0011 + 0000 0110 =

Convert the negative number to it’s 2’s complement equivalent

1001 0011 Æ start with sign bit 0 0001 0011

Flip the digits 1110 1100
Add one(1) + 1
-----------------------
This is 2’s comp 1110 1101

Now add the numbers

1110 1101
+ 0000 0110
-------------------------------
1111 0011
No Overflow
This is still in 2’s complement
Apply 2’s complement to number again

1111 0011 Æ Start with sign bit 0 0111 0011

Flip the digits 1000 1100
Add one(1) + 1
--------------------------------
1000 1101

- 1310

Copyright © 2008 by Helene G. Kershner