DMCA
An application of finite field: Design and implementation of 128-bit instruction-based fast pseudorandom number generator (2007)
Cached
Download Links
| Citations: | 10 - 0 self |
BibTeX
@TECHREPORT{Saito07anapplication,
author = {Mutsuo Saito},
title = {An application of finite field: Design and implementation of 128-bit instruction-based fast pseudorandom number generator},
institution = {},
year = {2007}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
(1) SIMD-oriented Mersenne Twister (SFMT) is a new pseudorandom number generator (PRNG) which uses 128-bit Single Instruction Multiple Data (SIMD) operations. SFMT is designed and implemented on C language with SIMD extensions and also implemented on standard C without SIMD. (2) Properties of SFMT are studied by using finite field theories, and they are shown to be equal or better than Mersenne Twister (MT), which is a widely used PRNG. (3) Generation speed of SFMT is measured on Intel Pentium M, Pentium IV, AMD Athlon 64 and PowerPC G4. It is shown to be about two times faster than MT implemented using SIMD. 1
