Abstract
This paper examines a pseudorandom number generator based on the generalized feedback shift register (GFSR) algorithm. The rational for the GFSR scheme versus the linear congruential scheme (which is the most commonly implemented) is threefold. The GFSR algorithm can produce streams of pseudorandom numbers of an arbitrarily long period (independent of the word length of the machine), the GFSR algorithm is faster, and the GFSR produces streams which are closer to the uniform distribution (especially for long streams and when the stream is viewed as a set of vectors in n-space). Also included is a discussion of some tests used to verify the uniformity and independence of streams of random numbers. Empirical results of the tests are presented for various pseudorandom number generators, including an implementation of the GFSR scheme, and compared.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call