1. Hi Guys,

Just wondering if there are any resident experts on floating point representation around these parts? I've got a few queries regarding it (it's taking a while to absorb into my brain) so hoping there are some folks around here who could assist.

2.

3. Ask your question. If someone reads it and knows the answer, they'll respond. Generally much easier to do that than to ask if anyone is an expert, as most will ignore such questions.

4. It's very likely that I can help you, since I answer that kind of question in the Help Lab here fairly often. (I assume you've read the homework policy though.)

5. Originally Posted by MagiMaster
It's very likely that I can help you, since I answer that kind of question in the Help Lab here fairly often. (I assume you've read the homework policy though.)
I have, thanks for pointing it out. I won't be asking for an answer, just verification that my understanding of the method is correct.

OK, if we're using standard 32-bit IEEE Standard 754 representation, we've got 1 bit for the sign, 8 bits exponent, 23 bits mantissa.

My query is the exponent is always added to 127 correct? So if we have 1.011 x 2^14, then the exponent is 14 + 127 = 141 = binary form of 141 in the 8 bits of the exponent. And the sign bit is always 1. Just want to be sure I understand this, the textbook is a little cryptic.

6. Yeah, you've got the exponent right, but the sign bit isn't always 1. It always takes up 1 bit, but its value depends on whether the represented number is positive or negative.

So, -1/3 which equals -0.01010101... in base-2, would first be normalized to -1.010101... * 2^-2, then stored as:

1 : 0111 1101 : 010 1010 1010 1010 1010 1010

 Bookmarks
##### Bookmarks
 Posting Permissions
 You may not post new threads You may not post replies You may not post attachments You may not edit your posts   BB code is On Smilies are On [IMG] code is On [VIDEO] code is On HTML code is Off Trackbacks are Off Pingbacks are Off Refbacks are On Terms of Use Agreement