Fourier Analysis of Uniform Random Number Generators
- 1 January 1967
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 14 (1) , 100-119
- https://doi.org/10.1145/321371.321379
Abstract
A method of analysis of uniform random number generators is developed, applicable to almost all practical methods of generation. The method is that of Fourier analysis of the output sequences of such generators. With this tool it is possible to understand and predict relevant statistical properties of such generators and compare and evaluate such methods. Many such analyses and comparisons have been carried out. The performance of these methods as implemented on differing computers is also studied. The main practical conclusions of the study are: (a) Such a priori analysis and prediction of statistical behavior of uniform random number generators is feasible. (b) The commonly used multiplicative congruence method of generation is satisfactory with careful choice of the multiplier for computers with an adequate (≥ ∼ 35-bit) word length. (c) Further work may be necessary on generators to be used on machines of shorter word length.Keywords
This publication has 7 references indexed in Scilit:
- Method in randomnessCommunications of the ACM, 1965
- Uniform Random Number GeneratorsJournal of the ACM, 1965
- Serial Correlation in the Generation of Pseudo-Random NumbersJournal of the ACM, 1960
- An Introduction to the Geometry of NumbersPublished by Springer Nature ,1959
- On Sequences of Pseudo-Random Numbers of Maximal LengthJournal of the ACM, 1958
- Observation on the Minimum of a Positive Quadratic Form in Eight VariablesJournal of the London Mathematical Society, 1944
- ber die Gleichverteilung von Zahlen mod. EinsMathematische Annalen, 1916