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
1) Converting 17.0 to binary Convert decimal part first, then the fractional part > First convert 17 to binary Divide 17 successively by 2 until the quotient 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 10001 So, 17 of decimal is 10001 in binary > Now, Convert 0.00000000 to binary > Multiply 0.00000000 with 2. Since 0.00000000 is < 1. then add 0 to result > This is equal to 1, so, stop calculating 0.0 of decimal is .0 in binary so, 17.0 in binary is 10001.0 17.0 in simple binary => 10001.0 so, 17.0 in normal binary is 10001.0 => 1. * 2^4 6-bit precision: -------------------- sign bit is 0(+ve) exp bits are (3+4=7) => 111 Divide 7 successively by 2 until the quotient is 0 > 7/2 = 3, remainder is 1 > 3/2 = 1, remainder is 1 > 1/2 = 0, remainder is 1 Read remainders from the bottom to top as 111 So, 7 of decimal is 111 in binary frac bits are 00 so, 17.0 in 6-bit precision format is 0 111 00 2) Converting 0.5 to binary Convert decimal part first, then the fractional part > First convert 0 to binary Divide 0 successively by 2 until the quotient is 0 Read remainders from the bottom to top as So, 0 of decimal is in binary > Now, Convert 0.50000000 to binary > Multiply 0.50000000 with 2. Since 1.00000000 is >= 1. then add 1 to result > This is equal to 1, so, stop calculating 0.5 of decimal is .1 in binary so, 0.5 in binary is .1 0.5 in simple binary => .1 so, 0.5 in normal binary is .1 => 1. * 2^-1 6-bit precision: -------------------- sign bit is 0(+ve) exp bits are (3-1=2) => 010 Divide 2 successively by 2 until the quotient is 0 > 2/2 = 1, remainder is 0 > 1/2 = 0, remainder is 1 Read remainders from the bottom to top as 10 So, 2 of decimal is 10 in binary frac bits are 00 so, 0.5 in 6-bit precision format is 0 010 00 3) Converting 6.0 to binary Convert decimal part first, then the fractional part > First convert 6 to binary Divide 6 successively by 2 until the quotient is 0 > 6/2 = 3, remainder is 0 > 3/2 = 1, remainder is 1 > 1/2 = 0, remainder is 1 Read remainders from the bottom to top as 110 So, 6 of decimal is 110 in binary > Now, Convert 0.00000000 to binary > Multiply 0.00000000 with 2. Since 0.00000000 is < 1. then add 0 to result > This is equal to 1, so, stop calculating 0.0 of decimal is .0 in binary so, 6.0 in binary is 110.0 -6.0 in simple binary => 110.0 so, -6.0 in normal binary is 110.0 => 1.1 * 2^2 6-bit precision: -------------------- sign bit is 1(-ve) exp bits are (3+2=5) => 101 Divide 5 successively by 2 until the quotient 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 101 So, 5 of decimal is 101 in binary frac bits are 10 so, -6.0 in 6-bit precision format is 1 101 10 4) Converting 7.5 to binary Convert decimal part first, then the fractional part > First convert 7 to binary Divide 7 successively by 2 until the quotient is 0 > 7/2 = 3, remainder is 1 > 3/2 = 1, remainder is 1 > 1/2 = 0, remainder is 1 Read remainders from the bottom to top as 111 So, 7 of decimal is 111 in binary > Now, Convert 0.50000000 to binary > Multiply 0.50000000 with 2. Since 1.00000000 is >= 1. then add 1 to result > This is equal to 1, so, stop calculating 0.5 of decimal is .1 in binary so, 7.5 in binary is 111.1 7.5 in simple binary => 111.1 so, 7.5 in normal binary is 111.1 => 1.11 * 2^2 6-bit precision: -------------------- sign bit is 0(+ve) exp bits are (3+2=5) => 101 Divide 5 successively by 2 until the quotient 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 101 So, 5 of decimal is 101 in binary frac bits are 11 so, 7.5 in 6-bit precision format is 0 101 11
6-bit floating-point encoding: 1 sign bit, 3 exponent bits, 2 frac bits( mantissa/significand) what is the...
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
What are the sign, mantissa, and exponent, of the single precision 32-Bits (IEEE754) floating point binary representation of 3.3? Show all steps needed to get the answer. Is the single precision floating point representation of 3.3 precise? Explain.
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...
Assume the following representation for a floating point number 1 sign bit, 4 bits exponent, 5 bits for the significand, and a bias of 7 for the exponent (there is no implied 1 as in IEEE). a) What is the largest number (in binary) that can be stored? Estimate it in decimal. b) What is the smallest positive number( closest to 0 ) that can be stored in binary? Estimate it in decimal.c) Describe the steps for adding two floating point numbers. d)...
Please show work, thanks. Consider the following two 16-bit floating-point representations 1. Format A. There is one sign bit There are k 6 exponent bits. The exponent bias is 31 (011111) There are n 9 fraction/mantissa bits 2. Format B There is one sign bit There are k 5 exponent bits. The exponent bias is 15 (01111) There are n 10 fraction/mantissa bits Problem 1 (81 points total /3 points per blank) Below, you are given some bit patterns in...
Can you write process of the question? A fictional floating-point encoding scheme uses 1 bit for sign followed by 1 bit for the exponent and 2 bits for the mantissa. It otherwise behaves exactly like the IEEE 754 encoding scheme. List down all decimal values that can be represented by this scheme along with their binary representation.
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 ?
Assume a 10-bit floating point representation format where the Exponent Field has 4 bits and the Fraction Field has 6 bits and the sign bit field uses 1 bit S Exponent Field: 4 bits Fraction Fleld: 5 bits a) What is the representation of -8.80158 × 10-2 in this Format - assume bias =2M-1-1=24-1-1=7 (where N= number of exponent field bits) for normalized representation 1 -bias =-6 : for denormalized representationb) What is the range of representation for...
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...
A certain microcomputer uses a binary floating-point format with 4 bits for the exponent contains 4 bits. The arithmetic e and 1 bit for the sign sigma. The normalized mantissa uses rounding. (a) Find the machine epsilon, i.e., the distance between 1 and the next larger floating- point number. (b) Let x = (7.125)_10. Find its floating-point approximation A(x). Give A(x) in decimal. (c) What is the relative error in A(x)