Implementing 64-bit Maximally Equidistributed Mersenne Twisters

@article{Harase2015Implementing6M,
  title={Implementing 64-bit Maximally Equidistributed Mersenne Twisters},
  author={Shin Harase and T. Kimoto},
  journal={ArXiv},
  year={2015},
  volume={abs/1505.06582}
}
  • Shin Harase, T. Kimoto
  • Published 2015
  • Mathematics, Computer Science
  • ArXiv
  • 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 recurrences modulo 2 are not completely optimized in terms of the equidistribution properties. Here we develop 64-bit maximally equidistributed pseudorandom number generators that are optimal in this respect and have speeds equivalent to 64-bit Mersenne… CONTINUE READING

    References

    SHOWING 1-10 OF 37 REFERENCES
    SIMD-Oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator
    • 255
    • PDF
    On the F2-linear relations of Mersenne Twister pseudorandom number generators
    • Shin Harase
    • Mathematics, Computer Science
    • Math. Comput. Simul.
    • 2014
    • 15
    • PDF
    Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
    • 5,071
    • Highly Influential
    • PDF
    Improved long-period generators based on linear recurrences modulo 2
    • 222
    • Highly Influential
    • PDF
    Efficient Jump Ahead for 2-Linear Random Number Generators
    • 55
    • PDF
    Maximally equidistributed pseudorandom number generators via linear output transformations
    • Shin Harase
    • Mathematics, Computer Science
    • Math. Comput. Simul.
    • 2009
    • 7
    Fast lattice reduction for F2-linear pseudorandom number generators
    • 7
    • PDF