Statistics – Computation
Scientific paper
Nov 1999
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1999spie.3807..350m&link_type=abstract
Proc. SPIE Vol. 3807, p. 350-358, Advanced Signal Processing Algorithms, Architectures, and Implementations IX, Franklin T. Luk;
Statistics
Computation
Scientific paper
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.
Flynn Michael J.
Mencer Oskar
Morf Martin
No associations
LandOfFree
Precision of semi-exact redundant continued fraction arithmetic for VLSI does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Precision of semi-exact redundant continued fraction arithmetic for VLSI, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Precision of semi-exact redundant continued fraction arithmetic for VLSI will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1513877