New algorithms for on-line computation of elementary functions

Sylvanus Kla; Christophe Mazenc; Xavier Merrheim; Jean-Michel Muller

doi:10.1117/12.49828

1 December 1991 New algorithms for on-line computation of elementary functions

Sylvanus Kla, Christophe Mazenc, Xavier Merrheim, Jean-Michel Muller

Proceedings Volume 1566, Advanced Signal Processing Algorithms, Architectures, and Implementations II; (1991) https://doi.org/10.1117/12.49828
Event: San Diego, '91, 1991, San Diego, CA, United States

Abstract

We present here some algorithms for on-line computation of elementary functions. These algorithms use shift-and-add as elementary step and need signed digit representations of numbers. Then, we give some theoretical results about on-line computation of functions. For instance, we show that a finite automaton (in practice a bounded size and memory operator) can compute in on-line only piecewise affine functions.

Citation Download Citation

Sylvanus Kla, Christophe Mazenc, Xavier Merrheim, and Jean-Michel Muller "New algorithms for on-line computation of elementary functions", Proc. SPIE 1566, Advanced Signal Processing Algorithms, Architectures, and Implementations II, (1 December 1991); https://doi.org/10.1117/12.49828

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available