{"id":211,"date":"2019-07-22T07:23:11","date_gmt":"2019-07-22T07:23:11","guid":{"rendered":"http:\/\/bcisnotes.com\/secondsemester\/?p=211"},"modified":"2020-01-09T14:39:18","modified_gmt":"2020-01-09T08:54:18","slug":"ones-and-twos-complement","status":"publish","type":"post","link":"https:\/\/bcisnotes.com\/secondsemester\/digital-systems\/ones-and-twos-complement\/","title":{"rendered":"One’s and Two’s Complement || Number System || Bcis Notes"},"content":{"rendered":"

Complements <\/strong><\/h2>\n

Complements are used in digital computers for simplifying the subtraction operation and for logical manipulation. There are two types of complements for each base- r system: r’s complement and the second as the (r – 1)’s complement. When the value of the base- r <\/em>is substituted, the two types are referred to as the One’s complement and Two’s complement for binary numbers, the 10’s complement and 9’s complement for decimal numbers, etc.<\/p>\n

(r-1)’s Complement (diminished radix complement.) <\/strong><\/p>\n

(r-1)’s complement of a number N is defined as (rn -1) \u2013N<\/p>\n

Where N <\/strong>is the given number<\/p>\n

r is the base of the number system <\/strong><\/p>\n

n <\/strong>is the number of digits in the given number<\/p>\n

To get the (r-1)’s complement fast, subtract each digit of a number from (r-1).<\/p>\n

Example: <\/strong><\/p>\n

– 9’s complement of 83510 is 16410 (Rule: (10n -1) \u2013N)<\/p>\n

– One’s complement of 10102 is 01012 (bit by bit complement operation)<\/p>\n

 <\/p>\n

 <\/p>\n

r’s Complement (radix complement) <\/strong><\/p>\n

r’s complement of a number N is defined as rn \u2013N<\/p>\n

Where N <\/strong>is the given number<\/p>\n

r is the base of a number system<\/p>\n

n <\/strong>is the number of digits in the given number<\/p>\n

To get the r’s complement fast, add 1 to the low-order digit of its (r-1)’s complement.<\/p>\n

Example: <\/strong><\/p>\n

– 10’s complement of 83510 is 16410 + 1 = 16510<\/p>\n

– Two’s complement of 10102 is 01012 + 1 = 01102<\/p>\n

 <\/p>\n

Subtraction with complements <\/strong><\/p>\n

The direct method of subtraction taught in elementary schools uses the borrowed concept. When subtraction is implemented with digital hardware, this method is found to be less efficient than the method that uses complements.<\/p>\n

The subtraction of two n-digit unsigned numbers M <\/em>– N <\/em>in base-r <\/em>can be done as follows:<\/p>\n

    \n
  1. Add the minuend M <\/em>to the r’s <\/em>complement of the subtrahend N. <\/em>This performs M <\/em>+ (rn \u2013N) <\/em>= M <\/em>–N <\/em>+ r”. <\/em><\/li>\n
  2. If M <\/em>>= N, <\/em>the sum will produce an end carry, r”, <\/em>which is discarded; what is left is the result M <\/em>– N. <\/em><\/li>\n
  3. If M <\/em>< N, <\/em>the sum does not produce an end carry and is equal to rn <\/em>– (N <\/em>– M), <\/em>which is the r’s <\/em>complement of (N <\/em>– M). <\/em>To obtain the answer in a familiar form, take the r’s complement of the sum and place a negative sign in front.<\/li>\n<\/ol>\n

    \"One's<\/p>\n

    Notes:<\/strong><\/h3>\n

    HEY! M <\/em>has 5 digits and N <\/em>has only 4 digits. Both numbers must have the same number of digits; so we can write N <\/em>as 03250. Taking the 10’s complement of N <\/em>produces a 9 in the most significant position. The occurrence of the end carries signifies that M >= N <\/em>and the result is positive.<\/p>\n

    Example II:<\/strong><\/p>\n

    \"One's<\/p>\n

    Example III:<\/strong><\/p>\n

    \"One's<\/p>\n

    Example IV: Repeating Example III using 1\u2019s complement.<\/strong><\/h3>\n

    \"One's<\/p>\n

     <\/p>\n

    You may like this Binary code<\/a><\/p>\n

    <\/div>