| Issue |
RAIRO-Theor. Inf. Appl.
Volume 35, Number 2, March-April 2001
|
|
|---|---|---|
| Page(s) | 187 - 206 | |
| DOI | https://doi.org/10.1051/ita:2001115 | |
| Published online | 15 April 2002 | |
On the number of iterations required by Von Neumann addition
1
Institut für Mathematische Stochastik,
Universität Hannover,
Postfach 60 09, 30060 Hannover, Germany;
(rgrubel@stochastik.uni-hannover.de)
2
Institut für Mathematische Stochastik,
Universität Hannover,
Postfach 60 09, 30060 Hannover, Germany
We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the input is random. Several authors have obtained results on the average case behaviour, mainly using analytic techniques based on generating functions. Here we take a more probabilistic view which leads to a limit theorem for the distribution of the random number of steps required by the algorithm and also helps to explain the limiting logarithmic periodicity as a simple discretization phenomenon.
Mathematics Subject Classification: 68Q25 / 65Y20
Key words: Carry propagation / limit distributions / total variation distance / logarithmic periodicity / Gumbel distributions / discretization / large deviations.
© EDP Sciences, 2001
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.