Share Email Print
cover

Proceedings Paper

New algorithms for on-line computation of elementary functions
Author(s): Sylvanus Kla; Christophe Mazenc; Xavier Merrheim; Jean-Michel Muller
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 1 December 1991
PDF: 11 pages
Proc. SPIE 1566, Advanced Signal Processing Algorithms, Architectures, and Implementations II, (1 December 1991); doi: 10.1117/12.49828
Show Author Affiliations
Sylvanus Kla, Ecole Normale Superieure de Lyon (France)
Christophe Mazenc, Ecole Normale Superieure de Lyon (France)
Xavier Merrheim, Ecole Normale Superieure de Lyon (France)
Jean-Michel Muller, Ecole Normale Superieure de Lyon (France)


Published in SPIE Proceedings Vol. 1566:
Advanced Signal Processing Algorithms, Architectures, and Implementations II
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top