Results 1  10
of
12
Semantics of Exact Real Arithmetic
, 1997
"... In this paper, we incorporate a representation of the nonnegative extended real numbers based on the composition of linear fractional transformations with nonnegative integer coefficients into the Programming Language for Computable Functions (PCF) with products. We present two models for the exten ..."
Abstract

Cited by 29 (8 self)
 Add to MetaCart
In this paper, we incorporate a representation of the nonnegative extended real numbers based on the composition of linear fractional transformations with nonnegative integer coefficients into the Programming Language for Computable Functions (PCF) with products. We present two models for the extended language and show that they are computationally adequate with respect to the operational semantics.
MSBFirst Digit Serial Arithmetic
, 1995
"... We develop a formal account of digit serial number representations by describing them as strings from a language. A prefix of a string represents an interval approximating a number by enclosure. Standard online representations are shown to be a special case of the general digit serial representati ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
We develop a formal account of digit serial number representations by describing them as strings from a language. A prefix of a string represents an interval approximating a number by enclosure. Standard online representations are shown to be a special case of the general digit serial representations. Matrices are introduced as representations of intervals and a finitestate transducer is used for mapping strings into intervals. Homographic and bihomographic functions are used for representing basic arithmetic operations on digit serial numbers, and finally a digit serial representation of floating point numbers is introduced.
LCF: A lexicographic binary representation of the rationals
 J. Universal Comput. Sci
, 1995
"... Abstract: A binary representation of the rationals derived from their continued fraction expansions is described and analysed. The concepts \adjacency", \mediant " and \convergent " from the literature on Farey fractions and continued fractions are suitably extended to pro ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract: A binary representation of the rationals derived from their continued fraction expansions is described and analysed. The concepts \adjacency&quot;, \mediant &quot; and \convergent &quot; from the literature on Farey fractions and continued fractions are suitably extended to provide a foundation for this new binary representation system. Worst case representationinduced precision loss for any real number by a xed length representable number of the system is shown to be at most 19 % of bit word length, with no precision loss whatsoever induced in the representation of any reasonably sized rational number. The representation is supported by a computer arithmetic system implementing exact rational and approximate real computations in an online fashion.
Arithmetic Unit Based on Continued Fraction
 TO APPEAR IN PROCEEDINGS OF ECI’2006 CONFERENCE
, 2006
"... We introduce architecture of an arithmetic unit that is based on continued fractions and allows computing any linear rational function of two variables, including basic arithmetic operations like addition, subtraction, multiplication and division. Such a unit can easily exploit the parallel nature o ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We introduce architecture of an arithmetic unit that is based on continued fractions and allows computing any linear rational function of two variables, including basic arithmetic operations like addition, subtraction, multiplication and division. Such a unit can easily exploit the parallel nature of continued fraction arithmetic and accelerate the otherwise low performance of its software implementation. The proposed architecture uses continued logarithms, which are an adapted variant of continued fractions and which suit hardware implementation more naturally through their bitlevel granularity. We have used FPGA to implement such a unit and we present here some experimental results, which demonstrate promising properties of the proposed architecture.
Precision of SemiExact Redundant Continued Fraction Arithmetic for VLSI
 VLSI, SPIE ADVANCED SIGNAL PROCESSING ALGORITHMS, ARCHITECTURES, AND IMPLEMENTATIONS IX
, 1999
"... 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 = ax+b cx+d , given redundant continued fractions x; y, and integers a; b; c; d. The im ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
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 = 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 12bit state registers from 78% to 98%. The maximal error of nonexact results is improved from 1 to 2 8 . Indeed, by detecting a small number of cases, we can add a nal correction step to improve the guaranteed accuracy of nonexact results. We refer