Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator

4.4kCitations
Citations of this article
1.4kReaders
Mendeley users who have this article in their library.
Get full text

Abstract

A 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-bit accuracy, while using a working area of only 624 words. This is a new variant of the previously proposed generators, TGFSR, modified so as to admit a Mersenne-prime period. The characteristic polynomial has many terms. The distribution up to v bits accuracy for 1 ≤ v ≤ 32 is also shown to be good. An algorithm is also given that checks the primitivity of the characteristic polynomial of MT with computational complexity O(p2) where p is the degree of the polynomial. We implemented this generator in portable C-code. It passed several stringent statistical tests, including diehard. Its speed is comparable to other modern generators. Its merits are due to the efficient algorithms that are unique to polynomial calculations over the two-element field.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Matsumoto, M., & Nishimura, T. (1998). Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator. In ACM Transactions on Modeling and Computer Simulation (Vol. 8, pp. 3–30). https://doi.org/10.1145/272991.272995

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 686

64%

Researcher 235

22%

Professor / Associate Prof. 124

11%

Lecturer / Post doc 34

3%

Readers' Discipline

Tooltip

Engineering 270

32%

Computer Science 266

32%

Physics and Astronomy 203

24%

Agricultural and Biological Sciences 97

12%

Save time finding and organizing research with Mendeley

Sign up for free