A Partial Exhaustive Search for Good Multiple Recursive Generators of Order Two
H-C Tang · 1998
This article identifies the efficient and non-efficient multipliers via forward and backward systematic search methods for the 2nd order multiple recursive generators (MRGs) with modulus 2(superscript 31)-1 that device a good random number generator. Among the more than 6442 million candidate multipliers vectors, it requires about 958 hours CPU for the forward and backward systematic search methods to find the multipliers vectors of the largest 20 spectral test for the full period 2nd order MRGs. The rests from the Beyer quotient, two-level traditional statistical tests and sparse occupancy tests indicate that the multiplier vector (1280550, -45991) passes all the tests. Thus (1280550, 45991) possesses long period, good lattice structure, sound statistical properties and suitable for practical simulation use.