Thumbnail
Access Restriction
Subscribed

Author Whittlesey, John RB
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Autocorrelation function ♦ Prime numbers ♦ Statistical tests for randomness ♦ Linear recurrence modulo two ♦ Pseudorandom number generators ♦ Serial correlation ♦ Ibm 360 ♦ Random numbers ♦ Primitive trinomials modulo two ♦ Congruential generators ♦ 32-bit versus 36-bit word size ♦ Irreducible polynomials ♦ Digital shift-register generators
Abstract Hutchinson states that the “new” (prime modulo) multiplicative congruential pseudorandom generator, attributed to D.H. Lehmer, has passed the usual statistical tests for random number generators. It is here empirically shown that generators of this type can produce sequences whose autocorrelation functions up to lag 50 exhibit evidence of nonrandomness for many multiplicative constants. An alternative generator proposed by Tausworthe, which uses irreducible polynomials over the field of characteristic two, is shown to be free from this defect.The applicability of these two generators to the IBM 360 is then discussed. Since computer word size can affect a generator's statistical behavior, the older mixed and simple congruential generators, although extensively tested on computers having 36 or more bits per word, may not be optimum generators for the IBM 360.
Description Affiliation: Mandrel Industries, Inc., Houston, TX (Whittlesey, John RB)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 11
Issue Number 9
Page Count 4
Starting Page 641
Ending Page 644


Open content in new tab

   Open content in new tab
Source: ACM Digital Library