mersenne-random
Version 0.1.2 revision 0 uploaded by DonaldStewart.
Package meta
- Synopsis
- Generate high quality pseudorandom numbers using a SIMD Fast Mersenne Twister
- Description
The Mersenne twister is a pseudorandom number generator developed by Makoto Matsumoto and Takuji Nishimura that is based on a matrix linear recurrence over a finite binary field. It provides for fast generation of very high quality pseudorandom numbers
This library uses SFMT, the SIMD-oriented Fast Mersenne Twister, a variant of Mersenne Twister that is much faster than the original. It is designed to be fast when it runs on 128-bit SIMD. It can be compiled with either SSE2 and PowerPC AltiVec support, to take advantage of these instructions.
By default the period of the function is 2^19937-1, however, you can compile in other defaults. Note that this algorithm on its own is not cryptographically secure.
For more information about the algorithm and implementation, see the SFMT homepage,
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
and, Mutsuo Saito and Makoto Matsumoto, /SIMD-oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator/, in the Proceedings of MCQMC2006, here:
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/ARTICLES/sfmt.pdf
- Author
- Don Stewart
- Bug reports
- n/a
- Category
- Math, System
- Copyright
- (c) 2008. Don Stewart <dons@galois.com>
- Homepage
- http://code.haskell.org/~dons/code/mersenne-random
- Maintainer
- Don Stewart <dons@galois.com>
- Package URL
- n/a
- Stability
- n/a