JUCS - Journal of Universal Computer Science 1(7): 484-503, doi: 10.3217/jucs-001-07-0484
LCF: A Lexicographic Binary Representation of the Rationals
expand article infoPeter Kornerup‡, David W. Matula§
‡ Dept. of Mathematics and Computer Science, Odense University, Odense, Denmark§ Dept. of Computer Science and Engineering, Southern Methodist University, Dallas, TX, United States of America

Corresponding author: Peter Kornerup ( kornerup@imada.ou.dk )

© Peter Kornerup, David Matula.
This article is freely available under the J.UCS Open Content License.
Citation: Kornerup P, Matula DW (1995) LCF: A Lexicographic Binary Representation of the Rationals. JUCS - Journal of Universal Computer Science 1(7): 484-503. https://doi.org/10.3217/jucs-001-07-0484
Open Access
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 provide a foundation for this new binary representation system. Worst case representation-induced precision loss for any real number by a fixed 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 on-line fashion.
Keywords
Computer arithmetic, continued fractions, lexicographic, number systems, number theory, rational numbers.