Chapter 03: Computer Arithmetic
Lesson 02:
Arithmetic Operations
Addition and subtraction
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
Objective
Understand sign extension of 2s complement
number
Negation
Addition
Subtraction
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
Sign Extension
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
Sign Extension
Used in order to equalize the number of bits in
two operands for addition and subtraction
Sign extension of 8-bit integer in 2s
complement number representation becomes 16bit number 2s complement number
representation by sign extension
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
Sign Extension
When m-bit number sign extends to get n-bit
number then bm-1 copies into extended places
upto bn-1.
msb (b7) in an 8 bit number copies into b15,
b14, b13, b12, b11, b10, b9 and b8 to get 16-bit
sign extended number in 2s complement
representation
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
Examples
01000011b becomes 000000000100 0011b
1100 0011b becomes 111111111100 0011b
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
Negation
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
Two's-complement
Original value: 0b00001100 (12)
Negate each bit: 0b11110011
Add 1:
0b11110100 (Two'scomplement representation of 12)
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
Perform Twos complement for negation
The 8-bit representation of +12 is 0b0000l100
The 8-bit two's-complement representation of
12 is 0b11110100
Add the 8-bit two's-complement representation
of 12, and + 12
0b0000 l100
+ 0b1111 0100
0b0000 0000
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
Addition
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
10
Carry
carry out of
low bit during addition
1
0b 1 0 0 1
0b 0 1 0 1
0b 1 1 1 0
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
11
Example + 3 4 using in 4-bit two'scomplement notation
The 4-bit two's-complement representations of
+3 and 4
0b0011 and
0b1100
Adding
0b1111
Answer Two's-complement representation of
1
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
12
Example 3 4 in 4-bit two's-complement
notation
4-bit 2s complement numbers can only be
between +7 and 8
To perform subtraction Negate the second
operand and add
Thus, actual computation perform 3 + (4)
The two's-complement representations of 3
and 4 are 0b1101 and 0b1100
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
13
Example 3 4 in 4-bit two's-complement
notation
Adding 0b1101 and 0b1100
Get 0b11001 (a 5-bit result, counting the
overflow)
Discarding the fifth bit when fourth bit = 1, we
get 0b 1001
Answer, the twos complement
representation of 7
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
14
Compute 7 4 using Sign Extension
4-bit 2s complement numbers can only be
between +7 and 8
To perform subtraction Negate the second
operand and add
Thus, actual computation performed 7 +
(4) after sign extension
The two's-complement representations of
7 and 4 after sign extension =
0b11111001 and 0b11111100
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
15
Compute 7 4 using Sign Extension
Adding 0b11111001 and 0b11111100
Get 0b111110101 (a 9-bit result, counting
the overflow)
Don't discard the ninth bit when eight bit =
0
Taking the ninth bit as sign of the result we
get 0b1 0000 1011, the results is 11d
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
16
Subtraction
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
17
Subtration of two positive numbers
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
18
Subtraction + 5 with + 3
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
19
Borrow
Borrow out of
high bit of subtraction
1
0b 0 0 0 1
(+1)
0b 0 0 1 1 Subtract (+3)
0b11 1 1 0 Answer (2)
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
20
+ 5 4 Add the quantities +5 and 4 in 4-bit
two's-complement notation
4-bit two's-complement representations of +5
and 4 are 0b0101 and 0b1100
Adding these together gives 0b10001, which is
the two's-complement representation of +1
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
21
3 4 Subtract 4 from 3 in 4-bit two'scomplement notation
4-bit 2s complement numbers can only be
between +7 and 8
To perform subtraction, we negate the second
operand and add
Thus, actual computation we want to perform
is 3 + (4)
The two's-complement representations of 3
and 4 are 0b1101 and 0b1100
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
22
Subtract 4 from 3
Adding these quantities, we get 0b11001 (a 5bit result, counting the overflow)
Discarding the fifth bit when fourth bit = 1, we
get 0b 1001, the twos complement
representation of 7
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
23
Subtract 4 from 11
4-bit 2s complement numbers can only be
between +7 and 8. To perform subtraction,
we use 8-bit numbers
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
24
Example
Find 0b00000100 0b11110101
Get 0b100000111 (a 9-bit result, counting the
overflow)
We don't discard the ninth bit when eight bit =
0
Taking the ninth bit as sign of the result we get
0b1 0000 0111, the results is (7)
Schaums Outline of Theory and Problems of Computer Architecture
Copyright The McGraw-Hill Companies Inc. Indian Special Edition 2009
25
Summary
We learnt
Sign Extension generates a higher bit twos
complement representation of a number
Addition uses carry to left
Implement by a circuit as negation followed by
addition is subtraction
Subtraction needs borrow to right and therefore,
it is easier to design circuit which does negation
of second operand and then performs add
operation
End of Lesson 2 on
Arithmetic Operations
Addition and subtraction
