A very long period (VLP) pseudorandom number generator for the microcomputer environment

Authors:
Gregory Bollella
Affiliations:
-
Venue:
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Year:
1988

Citing 4
Cited 1

Initializing generalized feedback shift register pseudorandom number generators

Journal of the ACM (JACM)
Generalized Feedback Shift Register Pseudorandom Number Algorithm

Journal of the ACM (JACM)
Partitioning the Period of a Class of m-Sequences and Application to Pseudorandom Number Generation

Journal of the ACM (JACM)
Analysis and synthesis of feedback queueing models for time-sharing systems.

Analysis and synthesis of feedback queueing models for time-sharing systems.

GFSR pseudorandom number generation using APL

Proceedings of the conference on APL '99 : On track to the 21st century: On track to the 21st century

Quantified Score

Hi-index	0.00

Visualization

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.