On converting numbers to the double-base number system

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5559, Issue , 2004, Pages 70-78

  Berthé, Valérie ^a   Imbert, Laurent ^a,b  

^a LIRMM   (France)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

Continued fractions; Diophantine approximation; Double base number system; Ostrowski's numeration

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER HARDWARE; DIGITAL SIGNAL PROCESSING; INTEGER PROGRAMMING; NUMBER THEORY; NUMERICAL ANALYSIS; SET THEORY;

CONTINUED FRACTIONS; DIOPHANTINE APPROXIMATION; DOUBLE BASE NUMBER SYSTEMS; INTEGERS; OSTROWSKI'S NUMERATION;

DIGITAL ARITHMETIC;

EID: 15844364585     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.558895     Document Type: Conference Paper

References (14)

1. V. S. Dimitrov, G. A. Jullien, and W. C. Miller, "Theory and applications of the double-base number system," IEEE Transactions on Computers 48, pp. 1098-1106, October 1999.
2. V. S. Dimitrov and T. V. Cooklev, "Two algorithms for modular exponentiation based on nonstandard arithmetics," IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science E78-A, pp. 82-87, January 1995. Special issue on cryptography and information security.
3. V. S. Dimitrov, J. Eskritt, L. Imbert, G. A. Jullien, and W. C. Miller, "The use of the multi-dimensional logarithmic number system in DSP applications," in 15th IEEE symposium on Computer Arithmetic, pp. 247-254, (Vail, CO, USA), June 2001.
4. R. Muscedere, Difficult Operations in the Multi-Dimensional Logarithmic Number System. PhD thesis, University of Windsor, Windsor, ON, Canada, 2003.
5. B. M. M. de Weger, Algorithms for Diophantine equations, vol. 65 of CWI Tracts, Centrum voor Wiskunde en Informatica, Amsterdam, 1989.
6. V. S. Dimitrov, G. A. Jullien, and W. C. Miller, "An algorithm for modular exponentiation," Information Processing Letters 66, pp. 155-159, May 1998.
7. J.-P. Allouche and J. Shallit, Automatic Sequences, Cambridge University Press, 2003.
8. E. Zeckendorf, "Représentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas," Fibonacci Quarterly 10, pp. 179-182, 1972.
9. V. Berthé, "Autour du système de numération d'Ostrowski," Bulletin of the Belgian Mathematical Society 8, pp. 209-239, 2001.
10. V. Berthé, N. Chekhova, and S. Ferenczi, "Covering numbers: Arithmetics and dynamics for rotations and internal exchanges," Journal d'Analyse Mathématique 79, pp. 1-31, 1999.
11. N. B. Slater, "Gaps and steps for the sequence nθ mod 1," Mathematical Proceedings of the Cambridge Philosophical Society 63, pp. 1115-1123, 1967.
12. V. T. Sós, "On the theory of diophantine approximations. I," Acta Mathematica Hungarica 8, pp. 461-472, 1957.
13. V. T. Sós, "On the theory of diophantine approximations. II," Acta Mathematica Hungarica 9, pp. 229-241, 1958.
14. V. T. Sós, "On a problem of Hartman about normal forms," Colloquium Mathematicum 7, pp. 155-160, 1960.