
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ClaudePierre Jeannerod, Hervé Knochel, Christophe Monat, Guillaume Revy, "Computing FloatingPoint Square Roots via Bivariate Polynomial Evaluation," IEEE Transactions on Computers, vol. 60, no. 2, pp. 214227, February, 2011.  
BibTex  x  
@article{ 10.1109/TC.2010.152, author = {ClaudePierre Jeannerod and Hervé Knochel and Christophe Monat and Guillaume Revy}, title = {Computing FloatingPoint Square Roots via Bivariate Polynomial Evaluation}, journal ={IEEE Transactions on Computers}, volume = {60}, number = {2}, issn = {00189340}, year = {2011}, pages = {214227}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.152}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Computing FloatingPoint Square Roots via Bivariate Polynomial Evaluation IS  2 SN  00189340 SP214 EP227 EPD  214227 A1  ClaudePierre Jeannerod, A1  Hervé Knochel, A1  Christophe Monat, A1  Guillaume Revy, PY  2011 KW  Binary floatingpoint arithmetic KW  square root KW  correct rounding KW  IEEE 754 KW  polynomial evaluation KW  instructionlevel parallelism KW  rounding error analysis KW  C software implementation KW  VLIW integer processor. VL  60 JA  IEEE Transactions on Computers ER   
[1] "IEEE Standard for Binary FloatingPoint Arithmetic," ANSI/IEEE Standard, Std 7541985, Am. Nat'l Standards Inst. and Inst. of Electrical and Electronic Engineers, 1985.
[2] "IEEE Standard for FloatingPoint Arithmetic," IEEE Std. 7542008, pp. 158, Aug. 2008.
[3] P. Montuschi and P.M. Mezzalama, "Survey of Square Rooting Algorithms," IEE Proc.—Computers and Digital Techniques, vol. 137, no. 1, pp. 3140, 1990.
[4] P. Markstein, IA64 and Elementary Functions: Speed and Precision. Prentice Hall, 2000.
[5] M. Cornea, J. Harrison, and P.T.P. Tang, Scientific Computing on ItaniumBased Systems. Intel Press, 2002.
[6] M.D. Ercegovac and T. Lang, Digital Arithmetic. Morgan Kaufmann, 2004.
[7] C.P. Jeannerod, H. Knochel, C. Monat, and G. Revy, "Faster FloatingPoint Square Root for Integer Processors," Proc. IEEE Symp. Industrial Embedded Systems (SIES '07), 2007.
[8] G. Revy, "Implementation of Binary FloatingPoint Arithmetic on Embedded Integer Processors—Polynomial EvaluationBased Algorithms and Certified Code Generation," PhD dissertation, Université de Lyon—École Normale Supérieure de Lyon, Dec. 2009.
[9] C.P. Jeannerod, H. Knochel, C. Monat, and G. Revy, "Computing FloatingPoint Square Roots via Bivariate Polynomial Evaluation," Technical Report RR200838, Laboratoire de l'Informatique du Parallélisme (LIP), http://prunel.ccsd.cnrs.frensl00335792, Oct. 2008.
[10] R.C. Agarwal, F.G. Gustavson, and M.S. Schmookler, "Series Approximation Methods for Divide and Square Root in the Power3 processor," Proc. IEEE Symp. Computer Arithmetic, I. Koren and P. Kornerup, eds., pp. 116123, 1999.
[11] J.A. Piñeiro and J.D. Bruguera, "HighSpeed DoublePrecision Computation of Reciprocal, Division, Square Root and Inverse Square Root," IEEE Trans. Computers, vol. 51, no. 12, pp. 13771388, Dec. 2002.
[12] S.K. Raina, "FLIP: A FloatingPoint Library for Integer Processors," PhD dissertation, École Normale Supérieure de Lyon, http://www.enslyon.fr/LIP/Pub/Rapports/ PhD/PhD2006PhD200602.pdf, 2006.
[13] J.M. Muller, Elementary Functions: Algorithms and Implementation, second ed. Birkhäuser, 2006.
[14] C.Q. Lauter, "Arrondi Correct de Fonctions Mathématiques— Fonctions Univariées et Bivariées, Certification et Automatisation," PhD dissertation, École Normale Supérieure de Lyon, 2008.
[15] S. Chevillard, "Évaluation Efficace de Fonctions Numériques— Outils et Exemples," PhD dissertation, École Normale Supérieure de Lyon, 2009.
[16] S. Chevillard and C. Lauter, "A Certified Infinite Norm for the Implementation of Elementary Functions," Proc. Seventh IEEE Int'l Conf. Quality Software (QSIC '07), A. Mathur, W.E. Wong, and M.F. Lau, eds., pp. 153160, 2007.
[17] S. Chevillard, M. Joldes, and C. Lauter, "Certified and Fast Computation of Supremum Norms of Approximation Errors," Proc. 19th IEEE Symp. Computer Arithmetic (ARITH19), June 2009.
[18] J. Harrison, T. Kubaska, S. Story, and P. Tang, "The Computation of Transcendental Functions on the IA64 Architecture," Intel Technology J., vol. Q4, pp. 17, 1999.
[19] Programming Languages—C, ISO/IEC Standard 9899:1999, Int'l Organization for Standardization, Dec. 1999.
[20] G. Melquiond, "De l'Arithmétique d'Intervalles à la Certification de Programmes," PhD dissertation, École Normale Supérieure de Lyon, http://www.msrinria.inria.fr/gmelquio/doc 06these. pdf, 2006.
[21] M. Daumas and G. Melquiond, "Certification of Bounds on Expressions Involving Rounded Operators," Trans. Math. Software, vol. 37, no. 1, 2009.
[22] F. de Dinechin, C. Lauter, and G. Melquiond, "Assisted Verification of Elementary Functions Using Gappa," Proc. 2006 ACM Symp. Applied Computing, http://www.msrinria.inria.fr/ gmelquio/ doc06mcmsarticle.pdf, pp. 13181322, 2006.
[23] J.A. Fisher, P. Faraboschi, and C. Young, Embedded Computing: A VLIW Approach to Architecture, Compilers and Tools. Morgan Kaufmann, 2005.
[24] C. Bruel, "IfConversion SSA Framework for Partially Predicated VLIW Architectures," Proc. Digest of the Fourth Workshop Optimizations for DSP and Embedded Systems, Mar. 2006.
[25] C.P. Jeannerod, H. Knochel, C. Monat, G. Revy, and G. Villard, "A New Binary FloatingPoint Division Algorithm and Its Software Implementation on the ST231 Processor," Proc. 19th IEEE Symp. Computer Arithmetic (ARITH19), June 2009.
[26] C.P. Jeannerod and G. Revy, "Optimizing CorrectlyRounded Reciprocal Square Roots for Embedded VLIW Cores," Proc. 43rd Asilomar Conf. Signals, Systems and Computers, Nov. 2009.