Computationally easy, spectrally good multipliers for congruential pseudorandom number generators

2020/01/15 by Guy Steele, Sebastiano Vigna, Steele, Guy +1 · 2 voices · 2 citations
#cs.DS

paper · pdf · doi:10.48550/arxiv.2001.05304

Abstract

Congruential pseudorandom number generators rely on good multipliers, that is, integers that have good performance with respect to the spectral test. We provide lists of multipliers with a good lattice structure up to dimension eight and up to lag eight for generators with typical power-of-two moduli, analyzing in detail multipliers close to the square root of the modulus, whose product can be computed quickly.

Cited by

• Code Division Modulation Layers Against Forgetting and Inference in Continual Gait Identification
• Efficient and Accurate Graph Classification with Hyperdimensional Computing on FPGA

Discussions

• Good multipliers for congruential pseudorandom number generators [hn, 19 points, 3 comments]
• Good multipliers for congruential pseudorandom number generators https://arxiv.org/abs/2001.05304 [bsky, 0 points, 0 comments]

Related

• Efficient and portable combined random number generators
• A Simple construction of the Pseudorandom Generator from Permutation
• Traversing a n-cube without Balanced Hamiltonian Cycle to Generate Pseudorandom Numbers
• A portable uniform random number generator well suited for the rejection method
• Harmonic analysis of random number generators