The unary arithmetical algorithm in bimodular number systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11620%2F13%3A10173409" target="_blank" >RIV/00216208:11620/13:10173409 - isvavai.cz</a>
Result on the web
<a href="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6545900" target="_blank" >http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6545900</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/ARITH.2013.10" target="_blank" >10.1109/ARITH.2013.10</a>
Alternative languages
Result language
angličtina
Original language name
The unary arithmetical algorithm in bimodular number systems
Original language description
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 linearaverage time complexity.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA13-03538S" target="_blank" >GA13-03538S: Algorithms, Dynamics and Geometry of Numeration systems</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
2013 21ST IEEE SYMPOSIUM ON COMPUTER ARITHMETIC (ARITH)
ISBN
978-0-7695-4957-6
ISSN
1063-6889
e-ISSN
—
Number of pages
8
Pages from-to
127-134
Publisher name
IEEE computer society
Place of publication
Los Alamitos, California, USA
Event location
Austin, Texas, USA
Event date
Apr 7, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000326337100016