Question: Let x1 and x2 be (b + 1)- bit binary numbers with magnitude less than 1. To compute the sum of x1 and x2 using

Let x1 and x2 be (b + 1)- bit binary numbers with magnitude less than 1. To compute the sum of x1 and x2 using two’s-complements representation we treat them as (b + 1)-bit unsigned numbers, we perform addition modulo-2 and ignore any carry after the sign bit.
(a) Show that if the sum of two numbers with the same sign has the opposite sign, this corresponds to overflow.
(b) Show that when we compute the sum of several numbers using two’s –complement representation, the result will be correct, even if there are overflows, if the correct sum is less than 1 in magnitude. Illustrate this argument by constructing a simple example with three numbers.

Step by Step Solution

3.36 Rating (180 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a Where x 1 and x 2 are positive the result is ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

31-E-T-E-D-S-P (853).docx

120 KBs Word File

Students Have Also Explored These Related Telecommunication Engineering Questions!