Scribd
Upload
254 views

Sics 154 Digital 2

Complements are used in digital computers to simplify subtraction operations and logical manipulation. There are two main types of complements: r's complement and (r-1)'s complement. The r's complement of a number N is defined as rn - N, while the (r-1)'s complement is defined as rn - r - m - N. Both can be used to perform subtraction by adding the minuend to the complement of the subtrahend. The 2's complement is preferable because it only requires one addition, while the 1's complement may require two additions with an end-around carry.

Uploaded by

Lovkumar77
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
254 views

Sics 154 Digital 2

Complements are used in digital computers to simplify subtraction operations and logical manipulation. There are two main types of complements: r's complement and (r-1)'s complement. The r's complement of a number N is defined as rn - N, while the (r-1)'s complement is defined as rn - r - m - N. Both can be used to perform subtraction by adding the minuend to the complement of the subtrahend. The 2's complement is preferable because it only requires one addition, while the 1's complement may require two additions with an end-around carry.

Uploaded by

Lovkumar77
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 13

COMPLEMENTS

Complements are used in digital computers for simplifying the subtraction operations and for logical manipulation. There are two types of complements for each base-r system. (1) the rs complement and (2) the (r-1)s complement. When the value of the base is substituted, the two types receives the names 2s and 1s complement for binary numbers or 10s and 9s complement for decimal numbers.

The rs Complement
Given a positive number N in base r with an integer part of n digits, the rs complement of N is defined as rn-N for N 0 and 0 for N=0. The following numerical example will help clarify the definition. The 10s complement of (52520)10 is 105-52520 =47480 The number of digits in the number is n=5 The 10s complement of (0.3267)10 is 1- 0.3267 = 0.6733 No integer part so 10n=100=1 The 10s complement of (25.639)10 is 102-25.639=74.361 The 2s complement of (101100)2 is (26)10 (101100)2=(1000000 - 101100)=010100 The 2s complement of (0.0110)2 is (1-0.0110)2=0.1010

The (r-1)s Complement


Given a positive number N in base r with an integer part of n digits, the (r-1)s complement of N is defined rn-r-m-N. Some numerical examples follow: The 9s complement of (52520)10 is (105-1-52520)=9999952520=47479. No fraction party, 10-m=100=1 The 9s complement of (0.3267)10 is (1-10-4-0.3267)=0.99990.3267=0.6732 No integer part, so 10n=100=1. The 9s complement of (25.639)10 is (102-10-325.639)=99.999-25.639=74.360 The 1s complement of (101100)2 is (26-1) (101100)=(111111-101100)=010011. The 1s complement of (0.0110)2 is (1-2-4)10 (0.0110) 2 = (0.1111-0.0110)2 =0.1001

From the examples, we see that the 9s complement of a decimal number is formed simply by subtracting every digit from 9. The 1s complement of a binary number is even simpler to form. The 1s are changed to 0s and the 0s to 1s. Since the (r-1)s complement is very easily obtained. It is sometimes convenient to use it when the rs complement is desired. From the definitions and a comparison of the results obtained in the examples, it follows that the rs complement can be obtained from the (r-1)s complement after the addition of r-m to the least significant digit. For example, the 2s complement of 10110100 is obtained from the 1s complement 01001011 by adding 1 to give 01001100.

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 corresponding subtrahend digit. This seems to be easiest when people perform subtraction with paper and pencil. When subtraction is implemented by means of digital components, this method is found to be less efficient than the method that uses complements and addition as stated below. The subtraction of two positive numbers (M-N), both of base r, may be done as follows:

Subtraction with rs complement

Add the minuend M to the rs complement of the subtrahend N. inspect the result obtained in step 1 for an end carry:
if an end carry discard it. If an end carry does not occur take the rs complement of the number obtained in step 1 and place a negative sign in front.

The following examples illustrate the procedures using 10s complement.

Subtract 72532-3250 M=72532 72532 N=03250 10s complement of N + 96750 End carry 1 69282 Answer: 69282 Subtract (3250-72533)10 M=03250 N=72532 03250 10s complement of N 27468 No carry 30718 Answer: -69282=(10s complement of 30718)

Subtraction with (r-1)s complement


The procedure for subtraction with the (r-1)s complement is exactly the same as oe variation, called, end-around carry as shown below. The subtraction of M-N, both positive numbers in base r, may be calculated in the following manner. Add the minuend M to the (r-1)s complement of the subtrahend N. inspect the result obtained in step 1 for an end carry if an end carry occurs, add 1 to the least significant digit (end-around carry) if an end does not occur, take the (r-1)s complement of the number obtained in step 1 and place a negative sign infront.

Example: M= 72532 N=03250 9s complement of N + 72532 96749 69281 1+ 69282

End around carry Answer: 69282 M= 03250 N= 72532

03250 9s complement of N + 27467 No carry 30717 Answer:-69282= -(9s complement of 30717)

Using 1s complement (a) M= 1010100 N= 1000100 1s complement of N = 0111011 1010100 +0111011 End-around carry 1 0001111 1+ 0010000 Answer: 10000
M=1000100

N=1010100 1s complement of N = 0101011 1000100 + 0101011 No carry 1101111 Answer: -10000 = -(1s complement of 1101111)

Use 2s complement to perform M-N with the given binary numbers.


M=1010100

N=1000100
M= 1000100

1010100 2s complement of N + 0111100 End carry 1 0010000

N=1010100 1000100 2s complement of N + 0101100 No carry 0010000 Answer: -10000 = -(2s complement of 1110000)

A comparison between 1s and 2s complements reveals the advantages and disadvantages of each. The 1s complement has the advantage of being easier to implement by digital components since the only thing that must be done is to change 0s to 1s and 1s to 0s. the implementation of the 2s complement may be obtained in two ways: (1) by adding 1 to the least significant digit of the 1s complement, and (2) by leaving all leading 0s in the least significant positions and the first 1 unchanged, and only then changing all 1s into 0s and all 0s into 1s. During subtraction of two numbers by complement, the 2s complement is advantageous in that only arithmetic addition operation is required. The 1s complement requires two arithmetic additions when an end-around carry occurs. The 1s complement has the additional disadvantage of possessing two arithmetic zeros: one with all 0sand one with all 1s.

Comparison between 1s and 2s Complements

To illustrate this fact, consider the subtraction of the two equal binary numbers 1100- 1100=0 Using 1s complement: 1100 + 0011 + 1111

Complement again to obtain -0000. Using 2s complement: 1100 + 0100 +0000 while the 2s complement has only one arithmetic zero, the 1s complement zero can be positive or negative, which may complicate matters

You might also like