### A New Pseudo-Random Number GeneratorA New Pseudo-Random Number Generator

Access Restriction
Subscribed

 Author Rotenberg, A. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1960 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract Although the multiplicative congruential method for generating pseudo-random numbers is widely used and has passed a number of tests of randomness [1, 2], attempts have been made to find an additive congruential method since it could be expected to be faster. Tests on a Fibonacci sequence [1] have shown it to be unsatisfactory. The sequence $\textit{x}\textit{i}+1$ = $(2\textit{a}$ + 1) $\textit{xi}$ + $\textit{c}$ (mod 235) (1) has been tested on the IBM 704. In appendix I it is shown that the sequence generates the full period of 235 numbers for $\textit{a}$ ≧ 2 and $\textit{c}$ odd. Similar results obtain for decimal machines. Since multiplication by a power of the base can be accomplished by shifting, which is comparable in speed to addition, this scheme requires essentially three additions. It takes 14 machine cycles on the IBM 704, compared to 28 for the multiplicative method, so that the saving is 168 μs/random number. The scheme has the further advantage that it does not destroy the multiplier-quotient register.Some tests have been made on the randomness of this sequence for $\textit{a}$ = 7 and $\textit{c}$ = 1, and a summary of the results is given in appendix II, where now the random numbers are considered to lie in the interval (0, 1). The serial correlation coefficient between one member of this sequence and the next is shown by Coveyou [3] to be approximately 0.8 per cent. By taking $\textit{a}$ = 9 this correlation coefficient can be reduced to approximately 0.2 per cent without increasing the time. Taking $\textit{a}$ = 21 would make this correlation very small but would require one more machine cycle on the IBM 704. Another way to reduce the correlation is to choose $\textit{c}$ such that the numerator in Coveyou's expression for the correlation coefficient is zero. This cannot be done exactly since it requires that $\textit{c}$ = (.5 ± $√3/6)2\textit{P}$ where $\textit{P}$ is the number of binary digits (excluding sign) in a machine word. However, a machine representation close to either of these numbers should be satisfactory. Some correlations with $\textit{c}$ = (.788+)235 and $\textit{a}$ = 7 were obtained and did not differ significantly from those given for $\textit{c}$ = 1 in the first section of appendix II.The author wishes to thank R. R. Coveyou for communicating his results in advance of publication and Elizabeth Wetherell for carrying out the calculations. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1960-01-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 7 Issue Number 1 Page Count 3 Starting Page 75 Ending Page 77

#### Open content in new tab

Source: ACM Digital Library