Fast pseudorandom generators for normal and exponential variates
- 1 March 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 22 (1), 119-127
- https://doi.org/10.1145/225545.225554
Abstract
Fast algorithms for generating pseudorandom numbers from the unit-normal and unit-exponential distributions are described. The methods are unusual in that they do not rely on a source of uniform random numbers, but generate the target distributions directly by using their maximal-entropy properties. The algorithms are fast. The normal generator is faster than the commonly used Unix library uniform generator “random” when the latter is used to yield real values. Their statistical properties seem satisfactory, but only a limited suite of tests has been conducted. They are written in C and as written assume 32-bit integer arithmetic. The code is publicly available as C source and can easily be adopted for longer word lengths and/or vector processing.Keywords
This publication has 2 references indexed in Scilit:
- A fast normal random number generatorACM Transactions on Mathematical Software, 1992
- An alias method for sampling from the normal distributionComputing, 1989