Efficient function approximation using truncated multipliers and squarers

E. George Walters, Michael J. Schulte

Research output: Contribution to conferencePaper

40 Scopus citations

Abstract

This paper presents a technique for designing linear and quadratic interpolators for function approximation using truncated multipliers and squarers. Initial coefficient values are found using a Chebyshev series approximation, and then adjusted through exhaustive simulation to minimize the maximum absolute error of the interpolator output. This technique is suitable for any function and any precision up to 24-bits (IEEE single precision). Designs for linear and quadratic interpolators that implement the reciprocal function, f(x) = 1/x, are presented and analyzed as an example. We show that a 24-bit truncated reciprocal quadratic interpolator with a design specification of ± 1 ulp error requires 24.1 % fewer partial products to implement than a comparable standard interpolator with the same error specification.

Original languageEnglish (US)
Pages232-239
Number of pages8
StatePublished - Dec 1 2005
Event17th IEEE Symposium on Computer Arithmetic, ARITH-17 2005 - Cape Cod, MA, United States
Duration: Jun 27 2005Jun 29 2005

Other

Other17th IEEE Symposium on Computer Arithmetic, ARITH-17 2005
CountryUnited States
CityCape Cod, MA
Period6/27/056/29/05

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Efficient function approximation using truncated multipliers and squarers'. Together they form a unique fingerprint.

  • Cite this

    Walters, E. G., & Schulte, M. J. (2005). Efficient function approximation using truncated multipliers and squarers. 232-239. Paper presented at 17th IEEE Symposium on Computer Arithmetic, ARITH-17 2005, Cape Cod, MA, United States.