The floating-point format to be used in this problem is a normalized format with 1 sign bit, 3 exponent bits, and 4 mantissa bits. The exponent field employs an excess-4 coding. The bit fields in a number are (sign, exponent, mantissa). Assume that we use unbiased rounding to the nearest even specified in the IEEE floating point standard.
(a) Encode the following numbers in the above format:
(b) (1) 1.0binary
(c) (2) 0.0011011binary
(b) In one sentence for each, state the purpose of guard, rounding, and sticky bits for floating point arithmetic.
(c) Perform rounding on the following fractional binary numbers, use the bit positions in
italics to determine rounding (use the rightmost 3 bits):
(1) Round to positive infinity: +0.100101110binary
(2) Round to negative infinity: -0.001111001binary
(4) Unbiased to the nearest even: +0.100101100binary
(5) Unbiased to the nearest even: -0.100100110binary
(d) What is the result of the square root of a negative number?
Correct Answer:
Verified
View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Q2: We're going to look at some ways
Q3: This problem covers floating-point IEEE format.
(a) List
Q4: This problem covers 4-bit binary multiplication. Fill
Q5: This problem covers 4-bit binary unsigned division
Q6: Consider 2's complement 4-bit signed integer addition
Q7: What is the smallest positive (not including
Q8: The floating-point format to be used in
Q10: Why is the 2's complement representation used
Q11: Prove that Sign Magnitude and One's Complement
Q12: Using 32-bit IEEE 754 single precision floating
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents