Computer Science, asked by prasadahana, 2 months ago

sketch out the guard bits and Truncation​

Answers

Answered by dsajan437
1

Answer:

Truncation

Chopping: simply drop all guard bits. We define the truncation error as: ...

Von Neumann Rounding: If at least one of the guard bits is 1, set. (no matter whether it is originally 0 or 1), otherwise do nothing. ...

Rounding: If the highest guard bit is 1 and the rest guard bits are not all 0, add 1 to LSB .

You can eliminate the possibility of overflow by appending the appropriate number of guard bits to a binary word. For a two's complement signed value, the guard bits are filled with either 0's or 1's depending on the value of the most significant bit (MSB).

Similar questions