A vectorized long-period shift-register random number generator
Salvatore Filippone, Paolo Santangelo, Marcello Vitaletti
Abstract
Salvatore Filippone, Paolo Santangelo, Marcello Vitaletti
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Shift register, Random number generation, Linear congruential generator, Pseudorandom number generator, Randomness, Generator (circuit theory), Computer science, Multiplicative function