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. © 1973, ACM. All rights reserved.
Recommended Citation
T. G. Lewis and W. H. Payne, "Generalized Feedback Shift Register Pseudorandom Number Algorithm," Journal of the ACM (JACM), vol. 20, no. 3, pp. 456 - 468, Association for Computing Machinery (ACM), Jul 1973.
The definitive version is available at https://doi.org/10.1145/321765.321777
Department(s)
Electrical and Computer Engineering
Keywords and Phrases
feedback shift register; Fourier analysis; GF(2); Kendall's algomthm; lattice; Lehmer; linear recurrence mod 2; primitive polynomial; pseudorandom numbers; Tausworthe; tests of randomness; wave properties
International Standard Serial Number (ISSN)
1557-735X; 0004-5411
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2023 Association for Computing Machinery (ACM), All rights reserved.
Publication Date
01 Jul 1973
