MSB-First Digit Serial Arithmetic

We develop a formal account of digit serial number representations by describing them as strings from a language. A pre x of a string represents an interval approximating a number by enclosure. Standard on-line representations are shown to be a special case of the general digit serial representations. Matrices are introduced as representations of intervals and a nite-state transducer is used for mapping strings into intervals. Homographic and bi-homographic functions are used for representing basic arithmetic operations on digit serial numbers, and nally a digit serial representation of oating point numbers is introduced.

[1]  Peter Kornerup,et al.  An Algorithm for Redundant Binary Bit-Pipelined Rational Arithmetic , 1990, IEEE Trans. Computers.

[2]  Peter Kornerup,et al.  Finite precision lexicographic continued fraction number systems , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

[3]  Peter Kornerup,et al.  Exploiting redundancy in bit-pipelined rational arithmetic , 1989, Proceedings of 9th Symposium on Computer Arithmetic.

[4]  Jean-Michel Muller,et al.  Some results about on-line computation of functions , 1989, Proceedings of 9th Symposium on Computer Arithmetic.

[5]  Jean Vuillemin,et al.  Exact real computer arithmetic with continued fractions , 1988, IEEE Trans. Computers.

[6]  Milos D. Ercegovac,et al.  Floating-point on-line arithmetic: Algorithms , 1981, 1981 IEEE 5th Symposium on Computer Arithmetic (ARITH).

[7]  Peter Kornerup,et al.  An On-Line Arithmetic Unit for Bit-Pipelined Rational Arithmetic , 1988, J. Parallel Distributed Comput..

[8]  Robert Michael Owens.  Techniques to Reduce the Inherent Limitations of Fully Digit On-Line Arithmetic , 1983, IEEE Transactions on Computers.