loading...
Correctly Rounded Multiplication by Arbitrary Precision Constants
Cape Cod, Massachusetts, USA June 27-June 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.2005.1317th IEEE Symposium on Computer Arith ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nicolas Brisebarre, Universit? Jean Monnet
Jean-Michel Muller, CNRS, Laboratoire LIP (CNRS/ENS Lyon/INRIA/Universit? Lyon 1)
We introduce an algorithm for multiplying a floating-point number x by a constant C that is not exactly representable in floating-point arithmetic. Our algorithm uses a multiplication and a fused multiply and add instruction. We give methods for checking whether, for a given value of C and a given floating-point format, our algorithm returns a correctly rounded result for any x. When it does not, our methods give the values x for which it does not.
Citation:
Nicolas Brisebarre, Jean-Michel Muller, "Correctly Rounded Multiplication by Arbitrary Precision Constants," arith, pp.13-20, 17th IEEE Symposium on Computer Arithmetic (ARITH'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.