Generalized Feedback Shift Register Pseudorandom Number Algorithm
- 1 July 1973
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 20 (3), 456-468
- https://doi.org/10.1145/321765.321777
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.Keywords
This publication has 6 references indexed in Scilit:
- An Asymptotically Random Tausworthe SequenceJournal of the ACM, 1973
- The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number GeneratorsJournal of the ACM, 1971
- Primitive trinomials whose degree is a Mersenne exponentInformation and Control, 1969
- A comparison of the correlational behavior of random number generators for the IBM 360Communications of the ACM, 1968
- Fourier Analysis of Uniform Random Number GeneratorsJournal of the ACM, 1967
- Uniform Random Number GeneratorsJournal of the ACM, 1965