Scribd
Upload
3 views

Chapter 02 - Binary Arithmetic(1)

The document covers multiple bit binary arithmetic, including addition and subtraction, as well as binary multiplication and complements. It explains the concepts of 1's and 2's complements for binary numbers and demonstrates how to perform arithmetic operations using these complements. Additionally, it discusses signed binary numbers and their representation, including the rules for addition and subtraction in signed-2's-complement form.

Uploaded by

ojidzg
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Chapter 02 - Binary Arithmetic(1)

The document covers multiple bit binary arithmetic, including addition and subtraction, as well as binary multiplication and complements. It explains the concepts of 1's and 2's complements for binary numbers and demonstrates how to perform arithmetic operations using these complements. Additionally, it discusses signed binary numbers and their representation, including the rules for addition and subtraction in signed-2's-complement form.

Uploaded by

ojidzg
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

ECE/CS 352: Digital System Fundamentals

Binary Arithmetic

Based on slides by:Charles Kime & Thomas Kaminski


© 2004 Pearson Education, Inc.
Multiple Bit Binary Addition
● Extending this to a multiple bit
examples:
Carries 00000
Augend 01100
Addend 10001
Sum 11101
Multiple Bit Binary Addition
● Extending this to a multiple bit
examples:
Carries 01100
Augend 10110
Addend 10111
Sum 101101
Multiple Bit Binary Subtraction
● Extending this to a multiple bit example:
● Notes:
– The 0 is a Borrow-In to the least significant bit.
– If the Subtrahend > the Minuend, interchange and append a – to the
result.

Borrows 00000
Minuend 10110
Subtrahend 10010
Difference 00100
Multiple Bit Binary Subtraction
● Extending this to a multiple bit examples:
● Notes: The 0 is a Borrow-In to the least significant
bit. If the Subtrahend > the Minuend, interchange
and append a – to the result.
Borrows 00110
Minuend 10110
Subtrahend 10011
Difference 00011
Binary Multiplication
Complements
● There are two types of complements for each base-r system: the radix complement and
diminished radix complement.
● Diminished Radix Complement - (r-1)’s Complement
– Given a number N in base r having n digits, the (r–1)’s
complement of N is defined as:
n
(r –1) – N
● Example for 6-digit decimal numbers:
n 6
– 9’s complement is (r – 1)–N = (10 –1)–N = 999999–N
– 9’s complement of 546700 is 999999–546700 = 453299
● Example for 7-digit binary numbers:
n 7
– 1’s complement is (r – 1) – N = (2 –1)–N = 1111111–N
– 1’s complement of 1011000 is 1111111–1011000 =
0100111
● Observation:
n
– Subtraction from (r – 1) will never require a borrow
– Diminished radix complement can be computed digit-by-
digit
Complements
● 1’s Complement (Diminished Radix
Complement)
– All ‘0’s become ‘1’s
– All ‘1’s become ‘0’s
Example (10110000)2
(01001111)2
If you add a number and its 1’s complement …
1 0 1 1 0 0 0 0
+ 0 1 0 0 1 1 1 1
1 1 1 1 1 1 1 1
Complements
● Radix Complement
The r's complement of an n-digit number N in base r is defined
as
n
r – N for N ≠ 0 and as 0 for N = 0. Comparing with the (r 1) 's
complement, we note that the r's complement is obtained by
n n
adding 1 to the (r 1) 's complement, since r – N = [(r 1) – N]
+ 1.
● Example: Base-10
The 10's complement of 012398 is 987602
The 10's complement of 246700 is 753300

● Example: Base-2
The 2's complement of 1101100 is 0010100
The 2's complement of 0110111 is 1001001
Complements
● 2’s Complement (Radix Complement)
– Take 1’s complement then add 1
OR – Toggle all bits to the left of the first ‘1’ from the
right
Example:
Number: 1 0 1 1 0 0 0 0 1 0 1 1 0 0 0 0
1’s Comp.: 0 1 0 0 1 1 1 1
+ 1
0 1 0 1 0 0 0 0 01 010 00 0
Complements
●Subtraction with Complements
– The subtraction of two n-digit unsigned
numbers M – N in base r can be done as
follows:
Complements
●Example 1.5
– Using 10's complement, subtract 72532 –
3250.

●Example 1.6
– Using 10's complement, subtract
There3250 –
is no end
carry.
72532.
Therefore, the answer is – (10's complement of 30718) = 69282.
Complements
●Example 1.7
– Given the two binary numbers X = 1010100
and Y = 1000011, perform the subtraction (a)
X – Y ; and (b) Y X, by using 2's complement.

There is no end carry.


Therefore, the answer is
Y – X = (2's
complement of
1101111) = 0010001.
Complements
● Subtraction of unsigned numbers can also be done by means of the (r
1)'s complement. Remember that the (r 1) 's complement is one less
then the r's complement.
● Example 1.8
– Repeat Example 1.7, but this time using 1's complement.

There is no end carry,


Therefore, the answer is Y
– X = (1's complement of
1101110) = 0010001.
Signed Binary Numbers
●To represent negative integers, we need a
notation for negative values.
●It is customary to represent the sign with a
bit placed in the leftmost position of the
number.
●The convention is to make the sign bit 0 for
positive and 1 for negative.
●Example:
Signed Binary Numbers
● Arithmetic addition
– The addition of two signed binary numbers with
negative numbers represented in signed-2's-
complement form is obtained from the addition of
the two numbers, including their sign bits.
– A carry out of the sign-bit position is discarded.
● Example:
Signed Binary Numbers
●Arithmetic Subtraction
– In 2’s-complement form:
1. Take the 2’s complement of the subtrahend (including the sign
bit) and add it to the minuend (including sign bit).
2. A carry out of sign-bit position is discarded.

( 6) ( 13) (11111010 11110011)


(11111010 + 00001101)
00000111 (+ 7)

You might also like