Abstract
The generalized feedback shift register pseudorandom number algorithm has several advantages over all other pseudorandom number generators. These advantages are: (1) it produces multidimensional pseudorandom numbers; (2) it has an arbitrarily long period independent of the word size of the computer on which it is implemented; (3) it is faster than other pseudorandom number generators; (4) the “same” floating-point pseudorandom number sequence is obtained on any machine, that is, the high order mantissa bits of each pseudorandom number agree on all machines— examples are given for IBM 360, Sperry-Rand-Univac 1108, Control Data 6000, and Hewlett-Packard 2100 series computers; (5) it can be coded in compiler languages (it is portable); (6) the algorithm is easily implemented in microcode and has been programmed for an Interdata computer.
- 1 COVEYOU, R. R., AND MAcPHERSON, R.D. Fourier analyms of uniform random number generators J. ACM 14, 1 (Jan 1967), 100-119. Google Scholar
- 2 KENDALL, M. G., AND SMITH, B. B. Randomness and random samphng numbers J Roy Statist. Soc 10I (1938), 162-164.Google Scholar
- 3 LEwis, P. A W, GOODMAN, A S, AND MILLER, J. M A pseudorandom number generator for the SYSTEM/360 IBM Syst. J. 8, 2 (1969), 136-146.Google Scholar
- 4 M:ACLAREN, M D, AND MARSAGLIA, G. Uniform random number generators. J.ACM 12, 1 (1965), 83-89. Google Scholar
- 5 MARSAGLIA, G. Random numbers fall mainly on the planes. Proc Nat. Acad. Sc~. 61, 1 (Sept 1968), 25-28.Google Scholar
- 6 PAYNE, W. H, AND LEWIS, T. G Conditional bit sampling: Accuracy and speed In Mathematzcal Software, J. R. Rice (Ed), Academic, New York, 1971, pp 331-345.Google Scholar
- 7 TAUSWORTHE, R. C Random numbers generated by linear recurrence modulo two Malh. Compul 19 (1965), 201-209.Google Scholar
- 8 TOOTILL, J P. R., ROBINSON, W. D, AND ADAMS, A G The runs up-and-down periormance of Tausworthe pseudo-random number generators. J ACM 18, 3 (1971), 381-399. Google Scholar
- 9 TOOTILL, j. P. R, ROnINSON: W. D, AND EAGLE, D.J. An asymptotlcally random Tausworthe sequence. J. ACM 20, 3 (July 1973), 469-481 (thin issue) Google Scholar
- 10 WHITTLESEY, J RB. A comparlson of the correlational behavior of random number generators for the IBM 360. Comm A CM I1, 9 (Sept 1968), 641-644 Google Scholar
- 11 WHITTLESEY, J. RB., AND GI~IESL, P. Multi-dimensional pseudorandom non-uniformity. Proc. of the UMR-Mervln J Kelly Communication Conference, Oct. 1970, U. of Missouri at Rolla, Rolla, Mo, pp. 15-4-1-15-4-6Google Scholar
- 12 ZIERLER, N. Prm~tive trinomlals whose degree is a Merseime exponent. Inform Contr. 15 (1969), 67-69.Google Scholar
- 13 ZIERLER, N , AND BRILLHART, J. On primitive trmommls (mod 2), II. Inform. Contr. I4 (1969), 566-569Google Scholar
Index Terms
Generalized Feedback Shift Register Pseudorandom Number Algorithm
Recommendations
The k-distribution of generalized feedback shift register pseudorandom numbers
A necessary and sufficient condition is established for the generalized feedback shift register (GFSR) sequence introduced by Lewis and Payne to be k-distributed. Based upon the theorem, a theoretical test for k-distributivity is proposed and performed ...
Initializing generalized feedback shift register pseudorandom number generators
The generalized feedback shift register pseudorandom number generators proposed by Lewis and Payne provide a very attractive method of random number generation. Unfortunately, the published initialization procedure can be extremely time consuming. This ...
A Statistical Analysis of Generalized Feedback Shift Register Pseudorandom Number Generators
We analyze the statistical performance of uniform pseudorandom numbers generated by the generalized feedback shift register (GFSR) algorithm of Lewis and Payne. Tests for equidistribution and for statistical independence of successive pseudorandom ...






Comments