Computation of Elementary Functions on the IBM RISC System/6000 Processors

No abstract is available for this paper.

• Publication year

  1990

• Venue

  IBM Journal of Research and Development

• Publication date

  1990-01-03

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1147/rd.341.0111
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An accurate elementary mathematical library for the IEEE floating point standard

  1991cited by this paper
• Design of the IBM RISC System/6000 Floating-Point Execution Unit

  1990cited by this paper
• Introduction to numerical analysis: 2nd edition

  1987cited by this paper
• New Scalar and Vector Elementary Functions for the IBM System/370

  1986cited by this paper
• Computing Elementary Functions: A New Approach for Achieving High Accuracy and Good Performance

  1985cited by this paper
• IEEE Standard for Binary Floating Point Arithmetic

  1985cited by this paper

• Emulation of the FMA and the correctly-rounded sum of three numbers in rounding-to-nearest floating-point arithmetic

  2025cites this paper
• Useful applications of correctly-rounded operators of the form ab + cd + e

  2024cites this paper
• Inexactness and Correction of Floating-Point Reciprocal, Division and Square Root

  2024cites this paper
• Floating-point arithmetic

  2023influential citation
• Fast Compensated Algorithms for the Reciprocal Square Root, the Reciprocal Hypotenuse, and Givens Rotations

  2021influential citation
• A Correctly Rounded Newton Step for the Reciprocal Square Root

  2021cites this paper
• Genetic improvement of data for maths functions

  2021cites this paper
• Genetic Programming: 23rd European Conference, EuroGP 2020, Held as Part of EvoStar 2020, Seville, Spain, April 15–17, 2020, Proceedings

  2020influential citation
• Evolving sqrt into 1/x via software data maintenance

  2020cites this paper
• Automatically Evolving Lookup Tables for Function Approximation

  2020cites this paper
• Genetic improvement of data gives double precision invsqrt

  2019cites this paper
• Evolving Better Software Parameters

  2018cites this paper
• FMA-Based Division

  2018cites this paper
• On relative errors of floating-point operations: Optimal bounds and applications

  2017cites this paper
• Decimal floating-point fused multiply-add with redundant internal encodings

  2016cites this paper
• Error Corrected K'th order Goldschmidt's Floating Point Number Division

  2015cites this paper
• A Variable Latency K'th Order Newton-Raphson's Floating Point Number Divider

  2014cites this paper
• Hardware-based algorithm for Sine and Cosine computations using fixed point processor

  2014cites this paper
• Contributions to computer arithmetic and applications to embedded systems. (Contribution à l'arithmétique des ordinateurs et applications aux systèmes embarqués)

  2014cites this paper
• Avoiding double roundings in scaled Newton-Raphson division

  2013cites this paper
• Decimal Floating-point Fused Multiply Add with Redundant Number Systems

  2013cites this paper
• Some issues related to double rounding

  2013cites this paper
• Contributions to floating-point arithmetic : Coding and correct rounding of algebraic functions. (Contributions à l'arithmétique flottante : codages et arrondi correct de fonctions algébriques)

  2012cites this paper
• RN / 12 / 03 Evolving Human Competitive Spectra-Based Fault Localisation Techniques 08 / 05 / 2012

  2012cites this paper
• Contributions to the Formal Verification of Arithmetic Algorithms. (Contributions à la vérification formelle d'algorithmes arithmétiques)

  2012cites this paper
• Exact and Approximated Error of the FMA

  2011cites this paper
• Computer Architecture, Fifth Edition: A Quantitative Approach

  2011cites this paper
• Augmented Precision Square Roots and 2-D Norms, and Discussion on Correctly Rounding sqrt(x^2+y^2)

  2011cites this paper
• Augmented Precision Square Roots and 2-D Norms, and Discussion on Correctly Rounding sqrt(x^2+y^2)

  2011cites this paper
• Formal Verification

  2011cites this paper
• Variable Latency Goldschmidt Algorithm Based on a New Rounding Method and a Remainder Estimate

  2011cites this paper
• Basic Properties and Algorithms

  2010cites this paper
• A Rounding Method to Reduce the Required Multiplier Precision for Goldschmidt Division

  2010cites this paper
• Newton-Raphson algorithms for floating-point division using an FMA

  2010cites this paper
• Scaling Newton-Raphson division iterations to avoid double rounding

  2010cites this paper
• Variable Latency Rounding for Golschmidt Algorithm with Parallel Remainder Estimation

  2009cites this paper
• Implementation of binary floating-point arithmetic on embedded integer processors - Polynomial evaluation-based algorithms and certified code generation

  2009cites this paper
• A New Binary Floating-Point Division Algorithm and Its Software Implementation on the ST231 Processor

  2009cites this paper
• A New Rounding Algorithm for Variable Latency Division and Square Root Implementations

  2008cites this paper
• en vue de l'obtention du grade de Docteur de l'Université de Lyon - École normale supérieure de Lyon dans la spécialité Chimie préparée au Laboratoire de Chimie

  2008cites this paper
• Correctly Rounded Multiplication by Arbitrary Precision Constants

  2008cites this paper
• A rounding method with improved error tolerance for division by convergence

  2008cites this paper
• Theorem Proving for Verification (Invited Tutorial)

  2008cites this paper
• Formally Verified Argument Reduction with a Fused Multiply-Add

  2007cites this paper
• Faster floating-point square root for integer processors

  2007cites this paper
• Contemporary data path design optimization

  2006cites this paper
• An iterative division algorithm for FPGAs

  2006cites this paper
• Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems

  2006cites this paper
• Floating-Point Verification Using Theorem Proving

  2006influential citation
• Choosing starting values for certain Newton-Raphson iterations

  2006cites this paper
• Some functions computable with a fused-mac

  2005cites this paper
• Automating custom-precision function evaluation for embedded processors

  2005cites this paper
• Choosing starting values for certain Newton – Raphson iterations

  2005cites this paper
• Floating-Point Verification

  2005cites this paper
• Correctly rounded multiplication by arbitrary precision constants

  2005cites this paper
• Accelerating correctly rounded floating-point division when the divisor is known in advance

  2004cites this paper
• CHAPTER 10 – Function Evaluation

  2004cites this paper
• Software implementations of division and square root operations for Intel® Itanium® processors

  2004cites this paper
• Analysis and applications of Priest's distillation

  2004cites this paper
• A floating-point library for integer processors

  2004cites this paper
• CHAPTER 7 – Reciprocal, Division, Reciprocal Square Root, and Square Root by Iterative Approximation

  2004cites this paper
• Relaxing the reciprocal error needed to achieve a fixed quotient error bound

  2003cites this paper
• Formal verification at Intel

  2003cites this paper
• Verification: Industrial Applications Notes to accompany lectures at 2003 Marktoberdorf Summer School

  2003cites this paper
• Choosing Starting Values for Newton-Raphson Computation of Reciprocals, Square-Roots and Square-Root Reciprocals

  2003cites this paper
• Digital Arithmetic

  2003cites this paper
• Formal Verification of Square Root Algorithms

  2003cites this paper
• Isolating critical cases for reciprocals using integer factorization

  2003cites this paper
• Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit

  2003cites this paper
• High precision computation of elementary functions in Maple

  2002cites this paper
• H.1 H.2 H.3 H.4

  2002cites this paper
• A new divide and conquer method for achieving high speed division in hardware

  2002cites this paper
• High precision computation of elementary functions in Maple

  2002cites this paper
• Accelerating Floating-Point Division When the Divisor is Known in Advance

  2002cites this paper
• Bounds on runs of zeros and ones for algebraic functions

  2001cites this paper
• Bound on Run of Zeros and Ones for Images of Floating-Point Numbers by Algebraic Functions

  2000cites this paper
• Cost/performance tradeoff of n-select square root implementations

  2000cites this paper
• System-level power consumption modeling and tradeoff analysis techniques for superscalar processor design

  2000cites this paper
• Formal Verification of IA-64 Division Algorithms

  2000influential citation
• Improving Goldschmidt Division, Square Root, and Square Root Reciprocal

  2000cites this paper
• A Machine-Checked Theory of Floating Point Arithmetic

  1999cites this paper
• Series approximation methods for divide and square root in the Power3/sup TM/ processor

  1999cites this paper
• On infinitely precise rounding for division, square root, reciprocal and square root reciprocal

  1999cites this paper
• A Bibliography of Publications on Floating-Point Arithmetic

  1999cites this paper
• Correctness proofs outline for Newton-Raphson based floating-point divide and square root algorithms

  1999cites this paper
• Improving Goldschmidt Division , Square Root and Square Root Reciprocal

  1999cites this paper
• Proving the IEEE Correctness of Iterative Floating-Point Square Root , Divide , and Remainder Algorithms

  1998cites this paper
• Error-correcting Goldschmidt dividers using time shared TMR

  1998cites this paper
• An Overview of Advanced Failure Analysis Techniques for Pentium and Pentium Pro Microprocessors 1 An Overview of Advanced Failure Analysis Techniques for Pentium and Pentium Pro Microprocessors

  1998cites this paper
• System-level Power Consumption Modeling and Tradeoo Analysis Techniques for Superscalar Processor Design

  1997cites this paper
• Fast error-correcting Newton-Raphson dividers using time shared TMR

  1997cites this paper
• Ultrafast compact CMOS dividers

  1997cites this paper
• Implementation of single precision floating point square root on FPGAs

  1997cites this paper
• Division Algorithms and Implementations

  1997cites this paper
• High-precision division and square root

  1997influential citation
• Area and performance tradeoffs in floating-point divide and square-root implementations

  1996cites this paper
• Fault tolerant Newton-Raphson dividers using time shared TMR

  1996cites this paper
• On Hardware for Computing Exponential and Trigonometric Functions

  1996cites this paper
• Fast IEEE Rounding for Division by Functional Iteration

  1996cites this paper
• A technique to determine power-efficient, high-performance superscalar processors

  1995cites this paper