Here's an open question, and I'd like to see some kind of proof (formal or empirical) that addresses it. Or maybe you can just look this up. Surely we can come up with a single example that addresses this. I'm just focused on writing code right now.
When adding two FP numbers of the same sign, the sum can have a 1-bit carry to the left of the normalization bit of the greater mantissa. In that case, we need to shift the sum right by one. But then we round. And when we do that, carries can propagate such that we get an overflow AGAIN and have to shift right by one again. I'm pretty sure that both can happen, ultimately requiring two right-shifts (by zero or one, so they're cheap). But am I right about that? -- Timothy Normand Miller, PhD Assistant Professor of Computer Science, Binghamton University http://www.cs.binghamton.edu/~millerti/<http://www.cse.ohio-state.edu/~millerti> Open Graphics Project
_______________________________________________ Open-graphics mailing list [email protected] http://lists.duskglow.com/mailman/listinfo/open-graphics List service provided by Duskglow Consulting, LLC (www.duskglow.com)
