The Unary Arithmetical Algorithm in Bimodular Number Systems

We analyze the performance of the unary arithmetical algorithm which computes a Moebius transformation in bimodular number systems which extend the binary signed system. We give statistical evidence that in some of these systems, the algorithm has linear average time complexity.

Saved in:
Bibliographic Details
Main Authors: Kurka, P., Delacourt, M.
Format: Conference Proceeding
Language:English
Subjects:
Absorption
Convergence
Electronic mail
expansion subshifts
extact real arithmetic
Moebius number systems
Random variables
Time complexity
Transducers
Vectors
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We analyze the performance of the unary arithmetical algorithm which computes a Moebius transformation in bimodular number systems which extend the binary signed system. We give statistical evidence that in some of these systems, the algorithm has linear average time complexity.
ISSN:1063-6889
DOI:10.1109/ARITH.2013.10