loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th IEEE Symposium on Computer Arithmetic (ARITH'05)
Correctly Rounded Multiplication by Arbitrary Precision Constants
Cape Cod, Massachusetts, USA
June 27-June 29
ISBN: 0-7695-2366-8
ASCII Text
x 
 
Nicolas Brisebarre, Jean-Michel Muller, "Correctly Rounded Multiplication by Arbitrary Precision Constants," Computer Arithmetic, IEEE Symposium on, pp. 13-20, 17th IEEE Symposium on Computer Arithmetic (ARITH'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ARITH.2005.13,
author = {Nicolas Brisebarre and Jean-Michel Muller},
title = {Correctly Rounded Multiplication by Arbitrary Precision Constants},
journal ={Computer Arithmetic, IEEE Symposium on},
volume = {0},
year = {2005},
issn = {1063-6889},
pages = {13-20},
doi = {http://doi.ieeecomputersociety.org/10.1109/ARITH.2005.13},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Arithmetic, IEEE Symposium on
TI - Correctly Rounded Multiplication by Arbitrary Precision Constants
SN - 1063-6889
SP13
EP20
A1 - Nicolas Brisebarre,
A1 - Jean-Michel Muller,
PY - 2005
KW - null
VL - 0
JA - Computer Arithmetic, IEEE Symposium on
ER -
 
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.