A vectorized long-period shift-register random number generator

Authors:
Salvatore Filippone;Paolo Santangelo;Marcello Vitaletti
Affiliations:
IBM European Center for Scientific and Engineering Computing, Via Giorgione 159, I-00147 Rome, Italy;IBM European Center for Scientific and Engineering Computing, Via Giorgione 159, I-00147 Rome, Italy;IBM European Center for Scientific and Engineering Computing, Via Giorgione 159, I-00147 Rome, Italy
Venue:
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Year:
1990

Citing 3
Cited 0

Maximum-length sequences, cellular automata, and random numbers

Journal of Computational Physics
Generalized Feedback Shift Register Pseudorandom Number Algorithm

Journal of the ACM (JACM)
Quasi-Random Number Sequences from a Long-Period TLP Generator with Remarks on Application to Cryptography

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A pseudo-random number generator, based on a linear-feedback shift-register sequence, is presented. The very long period of the generator, 21279 — 1, makes it useful in modern statistical simulations where the shorter period of other generators could either be exhausted during a single run or determine departures from uniform randomness when generating positions in a multidimensional space. In particular, the proposed generator overcomes the limitations of multiplicative-congruential generators with modulus 231 — 1, which are widely used on computers with a 32-bit integer word size, such as the IBM S/370 family of computers.