DocumentCode
610863
Title
The Unary Arithmetical Algorithm in Bimodular Number Systems
Author
Kurka, P. ; Delacourt, M.
Author_Institution
Center for Theor. Study, Charles Univ. in Prague, Prague, Czech Republic
fYear
2013
fDate
7-10 April 2013
Firstpage
127
Lastpage
134
Abstract
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.
Keywords
computational complexity; residue number systems; statistical analysis; Moebius transformation; bimodular number system; binary signed system; linear average time complexity; statistical evidence; unary arithmetical algorithm; Absorption; Convergence; Electronic mail; Random variables; Time complexity; Transducers; Vectors; Moebius number systems; expansion subshifts; extact real arithmetic;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Arithmetic (ARITH), 2013 21st IEEE Symposium on
Conference_Location
Austin, TX
ISSN
1063-6889
Print_ISBN
978-1-4673-5644-2
Type
conf
DOI
10.1109/ARITH.2013.10
Filename
6545900
Link To Document