Abstract
We analyze the performance of the unary arithmetical algorithm which computes a Mobius 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.