Consider a 8 bit floating point system that is designed to hold positive numbers only; four bits are assigned to mantissa, three bits are assigned to exponential and one bit is assigned to the sign of exponential. What is the absolute error (not the percentage relative error) when this system is used to represent zero?
To find the solution to this question we will have to first understand how a number is stored in the floating point format.
In the floating point format the first bit is the sign bit,
which is
for positive number and
for negative number.
The exponent and the mantissa part of a floating point number is
found out by finding the binary representation of the number in its
normal for. For eg. If the number is
then its binary form is
and in its normal for it is :
.
Here,
is the mantissa and
is the expontent.
While storeing it as a floating point, the exponent is stored in
the biased form and in the mantissa the first bit i.e
of the mantisa is not included in it (it is hidden i.e it
is always considered that there is a
before the bits of the mantissa). Biased form of the
exponent means that a bias is added to the exponent and then the
resultant sum is stored in its binary form. This bias is equal to
, where
is the number of bits reserved for exponent.This makes the
range of the exponent from
In this case,
No. of bits reserved for exponent, k = 3
No. of bits reserved for mantisa = 4
Here it is said that the floating point number is designed to store only positive number, so we will ignore the sign bit
The bias will be
. And the lowest possible value of the exponent will be
.
While representing
in a floating point format, there is a problem. The problem is
that the first bit of the mantisa is always considered to be
. So, we can't actually store absolute
in this format, but in place of it we can store a very small
number. And this is the error in storeing
The smallest possible number (positive) that we can store will
have the smallest value of exponent i.e.
and the mantisa will be all
. So the representation of
will actually be
.
In decimal
will be
.
The absolute error when the system is used to represent
zero is
Consider a 8 bit floating point system that is designed to hold positive numbers only; four...
Show your work. For 8-bit numbers, use 1 sign bit, 3 exponent bits, 4 mantissa bits: 1.)Convert 11.0 to 8-bit floating point format 2.)Convert -12.40625 to 8-bit floating point format For 32-bit numbers, use 1 sign bit, 8 exponent bits, 23 mantissa bits: 3.)Convert 119.59375 to 32-bit floating point format 4.)Convert -67.1015625 to 32-bit floating point format
ints) The following questions pertain to machine numbers (a) (2 points) For an 8-bit unsigned integer, what is the decimal equivalent of 10010101? (b) (3 points) For an S-bit signed integer, what is the decimal equivalent for the 2's compliment of 11010101? (c) (5 points) Consider an 8-bit floating point number like the one in Homework A2 (one sign bit, three exponent bits, and four assignable mantissa bits), what is the floating point number that associates with 01101 1001?
ints)...
Use a 10-‐bit model for floating point numbers, where one bit is used for the sign bit, 4 bits are used for the exponent with a bias of 7, and 5 bits are used for the fraction. What is the smallest and largest positive normal value that can be represented?
Floating Point Representation Consider a computer that stores information using 10 bits words. The first bit is for the sign of the number, the next 5 for the sign and magnitude of the exponent and the last 4 for the magnitude of the mantissa. The mantissa is normalized as described in class and in the textbook. a. Convert 1 00010 1001 to a base-10 system b. What is the highest number that can be stored on this computer? c. What...
Only Answer Part D! Thanks Floating Point Representation Consider a computer that stores information using 10 bits words. The first bit is for the sign of the number, the next 5 for the sign and magnitude of the exponent and the last 4 for the magnitude of the mantissa. The mantissa is normalized as described in class and in the textbook. a. Convert 1 00010 1001 to a base-10 system b. What is the highest number that can be stored...
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...
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...
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
1. Assume we are using the simple model for floating-point representation as given in this book (the representation uses a 14-bit format, 5 bits for the exponent with a bias of 15, a normalized mantissa of 8 bits, and a single sign bit for the number): a) Show how the computer would represent the numbers 100.0 and 0.25 using this floating-point format. b) Show how the computer would add the two floating-point numbers in part a by changing one of...
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...