Share Email Print

Proceedings Paper

Precision of semi-exact redundant continued fraction arithmetic for VLSI
Author(s): Oskar Mencer; Martin Morf; Michael J. Flynn
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Continued fractions (CFs) enable straightforward representation of elementary functions and rational approximations. We improve the positional algebraic algorithm, which computes homographic functions such as y equals ax+b/cx+d, given redundant continued fractions x,y, and integers a,b,c,d. The improved algorithm for the linear fractional transformation produces exact results, given regular continued fraction input. In case the input is in redundant continued fraction form, our improved linear algorithm increases the percentage of exact results with 12-bit state registers from 78% to 98%. The maximal error of non-exact results is improved from approximately 1 to 2-8. Indeed, by detecting a small number of cases, we can add a final correction step to improve the guaranteed accuracy of non-exact results. We refer to the fact that a few results may not be exact as 'Semi- Exact' arithmetic. We detail the adjustments to the positional algebraic algorithm concerning register overflow, the virtual singularities that occur during the computation, and the errors due to non-regular, redundant CF inputs.

Paper Details

Date Published: 2 November 1999
PDF: 9 pages
Proc. SPIE 3807, Advanced Signal Processing Algorithms, Architectures, and Implementations IX, (2 November 1999); doi: 10.1117/12.367651
Show Author Affiliations
Oskar Mencer, Stanford Univ. (United States)
Martin Morf, Stanford Univ. (United States)
Michael J. Flynn, Stanford Univ. (United States)

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

© SPIE. Terms of Use
Back to Top