Pseudorandom numbers for mini- and microcomputers : A generalized feedback shift register algorithm

The advantages of the generalized feedback shift register pseudorandom number algorithm over all other pseudorandom number generators are described. These advantages are: (1) It produces multidimensional pseudorandom numbers; (2) it has arbitrarily long period, independent of 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; and (5) it can be coded in compiler languages (is portable). This pseudorandom number generator is ideal for mini- and microcomputers, since only two additions and an exclusive-or are needed for its execution.