Resolution-stationary random number generators

Besides speed and period length, the quality of uniform random number generators (RNGs) is usually assessed by measuring the uniformity of their point sets, formed by taking vectors of successive output values over their entire period length. For F"2-linear generators, the commonly adopted measures of uniformity are based on the equidistribution of the most significant bits of the output. In this paper, we point out weaknesses of these measures and introduce generalizations that also give importance to the low-order (less significant) bits. These measures look at the equidistribution obtained when we permute the bits of each output value in a certain way. In a parameter search for good generators, a quality criterion based on these new measures of equidistribution helps to avoid generators that fail statistical tests targeting their low-order bits. We also introduce the notion of resolution-stationary generators, whose point sets are invariant under a multiplication by certain powers of 2, modulo 1. For such generators, least significant bits have the same equidistribution properties as the most significant ones. Tausworthe generators have this property. We finally show how an arbitrary F"2-linear generator can be made resolution-stationary by adding an appropriate linear transformation to the output. This provides new efficient ways of implementing high-quality and long-period Tausworthe generators.

[1]  Pierre L'Ecuyer,et al.  Random Number Generators Based on Linear Recurrences in F 2 w , 2003 .

[2]  Masanori Fushimi An equivalence relation between Tausworthe and GFSR sequences and applications , 1989 .

[3]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[4]  Pierre L'Ecuyer,et al.  Maximally equidistributed combined Tausworthe generators , 1996, Math. Comput..

[5]  Pierre L'Ecuyer,et al.  Uniform random number generation , 1994, Ann. Oper. Res..

[6]  J. P. R. Tootill,et al.  An Asymptotically Random Tausworthe Sequence , 1973, JACM.

[7]  Shu Tezuka,et al.  The k-distribution of generalized feedback shift register pseudorandom numbers , 1983, CACM.

[8]  R. Tausworthe Random Numbers Generated by Linear Recurrence Modulo Two , 1965 .

[9]  Makoto Matsumoto,et al.  Twisted GFSR generators II , 1994, TOMC.

[10]  Pierre L'Ecuyer,et al.  On the xorshift random number generators , 2005, TOMC.

[11]  S. Tezuka Uniform Random Numbers: Theory and Practice , 1995 .

[12]  Pierre L'Ecuyer,et al.  Tables of maximally equidistributed combined LFSR generators , 1999, Math. Comput..

[13]  Harald Niederreiter,et al.  New methods for pseudorandom numbers and pseudorandom vector generation , 1992, WSC '92.

[14]  Pierre L'Ecuyer,et al.  Improved long-period generators based on linear recurrences modulo 2 , 2004, TOMS.

[15]  Pierre L'Ecuyer,et al.  Efficient and portable combined Tausworthe random number generators , 1990, TOMC.

[16]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[17]  Pierre L'Ecuyer,et al.  TestU01: A C library for empirical testing of random number generators , 2006, TOMS.