Takuji Nishimura
Abstract
We give new parameters for a Mersenne Twister pseudorandom number gene rator for 64-bit word machines.
- COMPAGNER, A. 1991. The hierarchy of correlations in random binary sequences. J. Stat. Phys. 63, 883-896.Google Scholar
- COUTURE, R., L'ECUYER, P., AND TEZUKA, S. 1993. On the distribution of k-dimensional vectors for simple and combined Tausworthe sequences. Math. Comput. 60, 749-761.Google Scholar
- L'ECUYER, P. 1996. Maximally equidistributed combined Tausworthe generators. Math. Comput. 65, 213, 203-213. Google Scholar
- L'ECUYER, P. 1999a. Tables of linear congruential generators of different sizes and good lattice structure. Math. Comput. 68, 225, 249-260. Google Scholar
- L'ECUYER, P. 1999b. Tables of maximally equidistributed combined LFSR generators. Math. Comput. 68, 225, 261-269. Google Scholar
- LENSTRA, A. K. 1985. Factoring multivariate polynomials over finite fields. J. Comput. Syst. Sci. 30, 235-248.Google Scholar
- MATSUMOTO, M. AND KURITA, Y. 1994. Twisted GFSR generators II. ACM Trans. Model. Comput. Simul. 4, 3 (July), 254-266. Google Scholar
- MATSUMOTO, M. AND KURITA, Y. 1996. Strong deviations from randomness in m-sequences based on trinomials. ACM Trans. Model. Comput. Simul. 6, 2, 99-106. Google Scholar
- MATSUMOTO, M. AND NISHIMURA, T. 1998. Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8,1, 3-30. Google Scholar
- NIEDERREITER, H. 1993. Factorization of polynomials and some linear-algebra problems over finite fields. Linear Alg. Appl. 192, 301-328.Google Scholar
- NIEDERREITER, H. 1995. The multiple-recursive matrix method for pseudorandom number generation. Finite Fields Appl. 1, 3-30. Google Scholar
- TEZUKA, S. 1990. Lattice structure of pseudorandom sequences from shift register generators. In Proceedings of the 1990 Winter Conference on Simulation (WSC '90, New Orleans, LA, Dec.). ACM Press, New York, NY, 266-269. Google Scholar
- TEZUKA, S. 1994a. The k-dimensional distribution of combined GFSR sequences. Math. Comput. 62, 206 (Apr.), 809-817. Google Scholar
- TEZUKA, S. 1994b. A unified view of long-period random number generators. J. Oper. Res. Japan Soc. 37, 211-227.Google Scholar
- TOOTILL, J. P. R., ROBINSON, W. D., AND EAGLE, D. J. 1973. An asymptotically random Tausworthe sequence. J. ACM 20, 469-481. Google Scholar
Index Terms
- Tables of 64-bit Mersenne twisters
Recommendations
Implementing 64-bit Maximally Equidistributed F2-Linear Generators with Mersenne Prime Period
CPUs and operating systems are moving from 32 to 64 bits, and hence it is important to have good pseudorandom number generators designed to fully exploit these word lengths. However, existing 64-bit very long period generators based on linear ...
Variants of Mersenne Twister Suitable for Graphic Processors
This article proposes a type of pseudorandom number generator, Mersenne Twister for Graphic Processor (MTGP), for efficient generation on graphic processessing units (GPUs). MTGP supports large state sizes such as 11213 bits, and uses the high ...
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
Special issue on uniform random number generationA new algorithm called Mersenne Twister (MT) is proposed for generating uniform pseudorandom numbers. For a particular choice of parameters, the algorithm provides a super astronomical period of 219937 −1 and 623-dimensional equidistribution up to 32-...
Comments