Computationally easy, spectrally good multipliers for congruential pseudorandom number generators

01/15/2020
by   Guy Steele, et al.
0

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 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2016

Improving the Quality of Random Number Generators by Applying a Simple Ratio Transformation

It is well-known that the quality of random number generators can often ...
research
05/17/2020

Multi-Objective level generator generation with Marahel

This paper introduces a new system to design constructive level generato...
research
12/26/2019

Deep Learning Training with Simulated Approximate Multipliers

This paper presents by simulation how approximate multipliers can be uti...
research
03/09/2022

ArithsGen: Arithmetic Circuit Generator for Hardware Accelerators

Generators of arithmetic circuits can automatically deliver various impl...
research
03/05/2018

Some relations on prefix reversal generators of the symmetric and hyperoctahedral group

The pancake problem is concerned with sorting a permutation (a stack of ...
research
02/04/2020

Normalisers of primitive permutation groups in quasipolynomial time

We show that given generators for subgroups G and H of S_n, if G is prim...
research
11/26/2013

Brains and pseudorandom generators

In a pioneering classic, Warren McCulloch and Walter Pitts proposed a mo...

Please sign up or login with your details

Forgot password? Click here to reset