Digital Design
CEN 212
Chapter 1
Digital Systems and Binary Numbers
1.5 Complements
Complements are used in digital computers to simplify the
subtraction operation and for logical manipulation.
Simplifying operations leads to simpler, less expensive circuits to
implement the operations.
There are two types of complements for each base-r system: the
radix complement and diminished radix complement.
The first is referred to as r’s complement, and the second as (r-
1)’s complement.
For binary the 2’s complement and 1’s complements, and for
decimal the 10’s and the 9’s complement.
Complements
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:
(rn –1) – N
Example for 6-digit decimal numbers:
9’s complement is (rn – 1)–N = (106–1)–N = 999999–N
9’s complement of 546700 is 999999–546700 = 453299
Example for 7-digit binary numbers:
1’s complement is (rn – 1) – N = (27–1)–N = 1111111–N
1’s complement of 1011000 is 1111111–1011000 = 0100111
Observation:
Subtraction from (rn – 1) will never require a borrow
Diminished radix complement can be computed digit-by-digit
For binary: 1 – 0 = 1 and 1 – 1 = 0
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 …
10110000
+ 01001111
11111111
Complements
Radix Complement
The r's complement of an n-digit number N in base r is defined as
rn – 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 adding 1
to the (r 1) 's complement, since rn – N = [(rn 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’s Comp.:
10110000 10110000
01001111
+ 1
01010000 01010000
Complements
In case N contains radix point, the point should be removed
temporarily in order to form the r’s and (r-1)’s complement. The
radix point is then restored to the complement number in the
same relative position.
Note: The complement of the complement restores the number to
its original value.
Complements
Subtraction with Complements
The direct method of subtraction taught in elementary schools uses
the borrow concept. In this method, we borrow a 1 from a higher
significant position when the minuend digit is smaller than the
subtrahend digit. The method works well when people perform
subtraction with paper and pencil. However when subtraction is
implemented with digital hardware, the method is less efficient
than the method that uses complements.
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 3250 – 72532.
There is no end
carry.
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.
1.6 Signed Binary Numbers
Due to hard ware limitations, computers must represent
every thing with binary digits.
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 since binary digits.
The convention is to make the sign bit 0 for positive and
1 for negative.
Signed Binary Numbers
As an example consider the number 9, represented in binary with 8
bits. + 9 is represented with the a sign bit of 0 in the left most
position, followed by the binary equivalent of 9, which gives
00001001. Note that all eight bits must have a value; therefore,0’s
are inserted following the sign bit up to the first one. Although there
is only one way to represent +9, there are three different ways to
represent -9 with 8 bits.
Table 1.3 lists all possible four-bit signed binary numbers in the three
representations.
Signed Binary Numbers
