convert
5378.27 and 21.78 to Floating Point Standard (FPS) modified (16 bits) by changing 23 bit fractional part to a 7 bit fractional part. then multiply
Answer: 0 10001111 1100100 Explanation: ------------- Converting 5378.27 to binary Convert decimal part first, then the fractional part > First convert 5378 to binary Divide 5378 successively by 2 until the quotient is 0 > 5378/2 = 2689, remainder is 0 > 2689/2 = 1344, remainder is 1 > 1344/2 = 672, remainder is 0 > 672/2 = 336, remainder is 0 > 336/2 = 168, remainder is 0 > 168/2 = 84, remainder is 0 > 84/2 = 42, remainder is 0 > 42/2 = 21, remainder is 0 > 21/2 = 10, remainder is 1 > 10/2 = 5, remainder is 0 > 5/2 = 2, remainder is 1 > 2/2 = 1, remainder is 0 > 1/2 = 0, remainder is 1 Read remainders from the bottom to top as 1010100000010 So, 5378 of decimal is 1010100000010 in binary > Now, Convert 0.27000000 to binary > Multiply 0.27000000 with 2. Since 0.54000000 is < 1. then add 0 to result > Multiply 0.54000000 with 2. Since 1.08000000 is >= 1. then add 1 to result > Multiply 0.08000000 with 2. Since 0.16000000 is < 1. then add 0 to result > Multiply 0.16000000 with 2. Since 0.32000000 is < 1. then add 0 to result > Multiply 0.32000000 with 2. Since 0.64000000 is < 1. then add 0 to result > Multiply 0.64000000 with 2. Since 1.28000000 is >= 1. then add 1 to result > This is equal to 1, so, stop calculating 0.27000000000043656 of decimal is .010001 in binary so, 5378.27 in binary is 1010100000010.010001 5378.27 in simple binary => 1010100000010.010001 so, 5378.27 in normal binary is 1010100000010.010001 => 1.0101 * 2^12 16-bit format: -------------------- sign bit is 0(+ve) exp bits are (127+12=139) => 10001011 Divide 139 successively by 2 until the quotient is 0 > 139/2 = 69, remainder is 1 > 69/2 = 34, remainder is 1 > 34/2 = 17, remainder is 0 > 17/2 = 8, remainder is 1 > 8/2 = 4, remainder is 0 > 4/2 = 2, remainder is 0 > 2/2 = 1, remainder is 0 > 1/2 = 0, remainder is 1 Read remainders from the bottom to top as 10001011 So, 139 of decimal is 10001011 in binary frac bits are 0101000 so, 5378.27 in 16-bit format is 0 10001011 0101000 Converting 21.78 to binary Convert decimal part first, then the fractional part > First convert 21 to binary Divide 21 successively by 2 until the quotient is 0 > 21/2 = 10, remainder is 1 > 10/2 = 5, remainder is 0 > 5/2 = 2, remainder is 1 > 2/2 = 1, remainder is 0 > 1/2 = 0, remainder is 1 Read remainders from the bottom to top as 10101 So, 21 of decimal is 10101 in binary > Now, Convert 0.78000000 to binary > Multiply 0.78000000 with 2. Since 1.56000000 is >= 1. then add 1 to result > Multiply 0.56000000 with 2. Since 1.12000000 is >= 1. then add 1 to result > Multiply 0.12000000 with 2. Since 0.24000000 is < 1. then add 0 to result > Multiply 0.24000000 with 2. Since 0.48000000 is < 1. then add 0 to result > Multiply 0.48000000 with 2. Since 0.96000000 is < 1. then add 0 to result > Multiply 0.96000000 with 2. Since 1.92000000 is >= 1. then add 1 to result > This is equal to 1, so, stop calculating 0.7800000000000011 of decimal is .110001 in binary so, 21.78 in binary is 10101.110001 21.78 in simple binary => 10101.110001 so, 21.78 in normal binary is 10101.110001 => 1.010111 * 2^4 16-bit format: -------------------- sign bit is 0(+ve) exp bits are (127+4=131) => 10000011 Divide 131 successively by 2 until the quotient is 0 > 131/2 = 65, remainder is 1 > 65/2 = 32, remainder is 1 > 32/2 = 16, remainder is 0 > 16/2 = 8, remainder is 0 > 8/2 = 4, remainder is 0 > 4/2 = 2, remainder is 0 > 2/2 = 1, remainder is 0 > 1/2 = 0, remainder is 1 Read remainders from the bottom to top as 10000011 So, 131 of decimal is 10000011 in binary frac bits are 0101110 so, 21.78 in 16-bit format is 0 10000011 0101110 5378.27 x 21.78 = 1.0101 * 2^12 x 1.010111 * 2^4 = 1.1100100011 * 2^16 1.1100100011 * 2^16 16-bit format: -------------------- sign bit is 0(+ve) exp bits are (127+16=143) => 10001111 Divide 143 successively by 2 until the quotient is 0 > 143/2 = 71, remainder is 1 > 71/2 = 35, remainder is 1 > 35/2 = 17, remainder is 1 > 17/2 = 8, remainder is 1 > 8/2 = 4, remainder is 0 > 4/2 = 2, remainder is 0 > 2/2 = 1, remainder is 0 > 1/2 = 0, remainder is 1 Read remainders from the bottom to top as 10001111 So, 143 of decimal is 10001111 in binary frac bits are 1100100 so, 5378.27 x 21.78 in 16-bit format is 0 10001111 1100100 Answer: 0 10001111 1100100
convert 5378.27 and 21.78 to Floating Point Standard (FPS) modified (16 bits) by changing 23 bit...
Convert from 32-bit IEEE 754 Floating Point Standard (in hexadecimal) to decimal: 410C0000, with the following layout: first bit is sign bit, next 8 bits is exponent field, and remaining 23 bits is mantissa field; result is to be rounded up if needed. answer choices 9.125 8.75 7.75 4.625 6.3125
If we use the IEEE standard floating-point single-precision representation (1 sign bit, 8 bit exponent bits using excess-127 representation, 23 significand bits with implied bit), then which of the following hexadecimal number is equal to the decimal value 3.875? C0780000 40007800 Oo 40780000 40A80010 The binary string 01001001110000 is a floating-point number expressed using a simplified 14-bit floating-point representation format (1 sign bit, 5 exponent bits using excess-15 representation, and 8 significand bits with no implied bit). What is its...
What is the minimum and maximum floating-point number stored in a 64-bit register assuming 1 bit as a sign-bit, 16 bits for exponent and rest of the bits for significant ?
Consider the following floating point format: 1 sign bit, 4 mantissa bits, and 3 exponent bits in excess 4 format. Add 1 1111 110 0 0110 010 Multiply 1 1011 111 0 0100 010
Consider a 9-bit floating-point representation based on the IEEE floating-point format, with one sign bit, four exponent bits (k = 4), and four fraction bits (n = 4). The exponent bias is 24-1-1-7. The table that follows enumerates some of the values for this 9-bit floating-point representation. Fill in the blank table entries using the following directions: e : The value represented by considering the exponent field to be an unsigned integer (as a decimal value) E: The value of...
6-bit floating-point encoding: 1 sign bit, 3 exponent bits, 2 frac bits( mantissa/significand) what is the exact 6-bit floating-point encoding for the following numbers: 17 0.5 -6 7.5 Please show the steps
5p Question 5 Convert the decimal number 9.625 to a floating-point number expressed in the 14-bit simple model given in your text (1 bit for the sign, 5 bits for exponent using excess-15 notation, and 8 bit mantissa with no implied bit).
Inspired of the IEEE 754 standard, a floating point format that is only 10 bits wide is defined for a special computer. The leftmost bit is still the sign bit, the exponent is 5 bits wide and has a bias of 15, and the fractions is 4 bits long. A hidden 1 is assumed for the normal number, but not for the denormalized number. c) Construct a case to show that floating point addition is not associative
1a. convert the following decimal number to 32 bit single precision Floating point binary number and convert that binary number to hexadecimal NUMBER = -134.5 in decimal b. convert the following 32-bit single precision floating point number to decimal: 01000111111100000000000000000000 2. Using Booth's algorithm, multiply the decimal numbers -12 and +13. 3. you have two improvement alternatives, which is better and why? The first one improves 15% of the instructions, and it improves that speed by a factor of 6....
I would like a step by step explanation as to how the 7-bit floating point representations from Format A were converted to Format B. Thanks. Consider the following two 7-bit floating point representations based on the IEEE floating point format. Neither has a sign bit - they can only represent non-negative numbers. i). Format A. There are k=3 exponent bits. The exponent bias is 3. There are n=4 fraction bits. ii). Format B. There are k=4 exponent bits. The exponent...