Translator Disclaimer
1 December 1991 New algorithms for on-line computation of elementary functions
Author Affiliations +
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.
© (1991) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
Back to Top