Gaussian random number generators

ACM Computing Surveys

Volumn 39, Issue 4, 2007, Pages

  Thomas, David B ^a   Luk, Wayne ^a   Leong, Philip H W ^b   Villasenor, John D ^c  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Gaussian; Normal; Random numbers; Simulation

Indexed keywords

GAUSSIAN PROBABILITY DENSITY FUNCTION; GAUSSIAN RANDOM NUMBER GENERATORS (GRNG); RANDOM NUMBERS;

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; PROBABILITY DENSITY FUNCTION;

GAUSSIAN DISTRIBUTION;

EID: 36048989090     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/1287620.1287622     Document Type: Article

References (59)

1. AHRENS, J. H. AND DIETER, U. 1972. Computer methods for sampling from the exponential and normal distributions. Comm. ACM 15, 10, 873-882.
2. AHRENS, J. H. AND DIETER, U. 1988. Efficient table-free sampling methods for the exponential, Cauchy, and normal distributions. Comm. ACM 31, 11, 1330-1337.
3. ANDRAKA, R. AND PHELPS, R. 1998. An FPGA based processor yields a real time high fidelity radar environment simulator. In Military and Aerospace Applications of Programmable Devices and Technologies Conference.
4. BELL, J. R. 1968. Algorithm 334: Normal random deviates. Comm. ACM 11, 7, 498.
5. BOUTILLON, E., DANGER, J.-L., AND GHAZEL, A. 2003. Design of high speed AWGN communication channel emulator. Analog Integr. Circ. Sig. Proc. 34, 2, 133-142.
6. BOX, G. E. P. AND MULLER, M. E. 1958a. A note on the generation of random normal deviates. Annals Math. Stat. 29, 610-611.
7. BOX, G. E. P. AND MULLER, M. E. 1958b. A note on the generation of random normal deviates. Annals Math. Stat. 29, 2, 610-611.
8. BRENT, R. P. 1974. Algorithm 488: A Gaussian pseudo-random number generator. Comm. ACM 17, 12, 704-706.
9. BRENT, R. P. 1993. Fast normal random number generators on vector processors. Tech. Rep. TR-CS-93-04, Department of Computer Science, The Australian National University, Canberra 0200 ACT, Australia.
10. BRENT, R. P. 1997. A fast vectorised implementation of Wallace's normal random number generator. Tech. Rep. TR-CS-97-07, Department of Computer Science, The Australian National University, Canberra 0200 ACT, Australia.
11. BRENT, R. P. 2003. Some comments on C. S. Wallace's random number generators. Comput. J., to appear.
12. CHEN, J., MOON, J., AND BAZARGAN, K. 2004. Reconfigurable readback-signal generator based on a field-programmable gate array. IEEE Trans. Magn. 40, 3, 1744-1750.
13. CHEN, W AND BURFORD, R. L. 1981. Quality evaluation of some combinations of unit uniform random number generators and unit normal transformation algorithms. In ANSS '81: Proceedings of the 14th Annual Symposium on Simulation. IEEE Press, Piscataway, NJ. 129-149.
14. DANGER, J.-L., GHAZEL, A., BOUTILLON, E., AND LAAMARI, H. 2000. Efficient FPGA implementation of Gaussian noise generator for communication channel emulation. In ICECS'2000. IEEE, Jounieh, Lebanon.
15. DEVROYE, L. 1986. Non-Uniform Random Variate Generation. Springer-Verlag, http://cg.scs.carlaton.ca/~luc/rnbookindex.html, New York.
16. FORSYTHE, G. E. 1972. Von Neumann's comparison method for random sampling from the normal and other distributions. Math. Computation 26, 120, 817-826.
17. GEBHARDT, F. 1964. Generating normally distributed random numbers by inverting the normal distribution function. Math. Computation 18, 86, 302-306.
18. HÖRMANN, W. 1994. A note on the quality of random variates generated by the ratio of uniforms method. ACM Trans. Model. Comput. Simul. 4, 1, 96-106.
19. KABAL, P. 2000. Generating Gaussian pseudo-random deviates. Tech. Rep., Department of Electrical and Computer Engineering, McGill University.
20. KINDERMAN, A. J. AND MONAHAN, J. F. 1977. Computer generation of random variables using the ratio of uniform deviates. ACM Trans. Math. Softw. 3, 3, 257-260.
21. KNOP, R. 1969. Remark on Algorithm 334 [g5]: normal random deviates. Comm. ACM 12, 5, 281.
22. KNUTH, D. E. 1981. Seminumerical Algorithms, Second ed. The Art of Computer Programming, vol. 2. Addison-Wesley, Reading, Massachusetts.
23. KRONMAL, R. 1964. Evaluation of a pseudorandom normal number generator. J. ACM 11, 3, 357-363.
24. L'ECUYER, P. 1992. Testing random number generators. In WSC '92: Proceedings of the 24th Conference on Winter Simulation. ACM Press, New York, NY. 305-313.
25. L'ECUYER, P. 1996. Maximally equidistributed combined Tausworthe generators. Math. Computation 65, 213, 203-213.
26. L'ECUYER, P. 2001. Software for uniform random number generation: distinguishing the good and the bad. In WSC '01: Proceedings of the 33nd Conference on Winter Simulation. IEEE Computer Society, Washington, DC. 95-105.
27. L'ECUYER, P. AND SIMARD, R. 2005. TestU01.http://www.iro.umontreal.ca/~simardr/indexe.html.
28. LEE, D.-U., LUK, W., VILLASENOR, J. D., AND CHEUNG, P. Y. 2004. A Gaussian noise generator for hardware-based simulations. IEEE Trans. Comput. 53, 12 (Dec.), 1523-1534.
29. LEHMER, D. H. 1949. Mathematical methods in large-scale computing units. In Proceedings of the 2nd Symposium on Large-Scale Digital Calculating Machinery. Harvard University Press, Cambridge, Massachusetts, 141-146.
30. LEVA, J. L. 1992a. Algorithm 712; a normal random number generator. ACM Trans. Math. Softw. 18, 4, 454-455.
31. LEVA, J. L. 1992b. A fast normal random number generator. ACM Trans. Math. Softw. 18, 4, 449-453.
32. MARSAGLIA, G. 1964. Generating a variable from the tail of the normal distribution. Technometrics 6, 101-102.
33. MARSAGLIA, G. 1997. The Diehard random number test suite. http://stat.fsu.edu/pub/diehard/.
34. MARSAGLIA, G. 2004. Evaluating the normal distribution. J. Statis. Softw. 11, 4, 1-11.
35. MARSAGLIA, G. AND BRAY, T. A. 1964. A convenient method for generating normal variables. SIAM Rev. 6, 3, 260-264.
36. MARSAGLIA, G., MACLAREN, M. D., AND BRAY, T. A. 1964. A fast procedure for generating normal random variables. Comm. ACM 7, 1, 4-10.
37. MARSAGLIA, G. AND TSANG, W. W. 1984a. A fast, easily implemented method for sampling from decreasing or symmetric unimodal density functions. SIAM J. Sci. Statis. Comput. 5, 349-359.
38. MARSAGLIA, G. AND TSANG, W. W. 1984b. A fast, easily implemented method for sampling from decreasing or symmetric unimodal density functions. SIAM J. Sci. Stat. Comput. 5, 2 (June), 349-359.
39. MARSAGLIA, G. AND TSANG, W. W. 1998. The Monty Python method for generating random variables. ACM Trans. Math. Softw. 24, 3, 341-350.
40. MARSAGLIA, G. AND TSANG, W. W. 2000. The ziggurat method for generating random variables. J. Statis. Softw. 5, 8, 1-7.
41. MATSUMOTO, M. AND NISHIMURA, T. 1998. Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8, 1 (Jan.), 3-30.
42. MCCOLLUM, J. M., LANCASTER, J. M., BOULDIN, D. W., AND PETERSON, G. D. 2003. Hardware acceleration of pseudo-random number generation for simulation applications. In IEEE Southeastern Symposium on System Theory. IEEE, Morgantown, WV.
43. 435 years is a very long time, http : //www. mathworks. com/company/newsletters/news_notes/pdf/ Cleve.pdf.
44. MOLER, C. B. 2004. Numerical Computing in Matlab. Society for Industrial and Applied Mathematics, USA.
45. MOLLE, J. W. D., HINICH, M. J., AND MORRICE, D. J. 1992. Higher-order cumulant spectral-based statistical tests of pseudo-random variate generators. In WSC '92: Proceedings of the 24th conference on Winter simulation. ACM Press, New York, NY. 618-625.
46. MULLER, M. E. 1958. An inverse method for the generation of random normal deviates on large-scale computers. Mathematical Tables and Other Aids to Computation 12, 63, 167-174.
47. MULLER, M. E. 1959. A comparison of methods for generating normal deviates on digital computers. J. ACM 6, 3, 376-383.
48. PIKE, M. C. 1965. Algorithm 267: random normal deviate [g5], Comm. ACM 8, 10, 606.
49. PRESS, W. H., TEUKOLSKY, S. A., VETTERLING, W. T., AND FLANNERY, B. P. 1997. Numerical Recipes in C, Second ed. Cambridge University Press, Cambridge.
50. RUKHIN, A., SOTO, J., NECHVATAL, J., SMID, M., BARKER, E., LEIGH, S., LEVENSON, M., VANGEL, M., BANKS, D., HECKERT, A., DRAY, J., AND VO, S. 2001. A statistical test suite for random and pseudorandom number generators for cryptographic applications. NIST special publication 800-22, National Institute of Standards and Technology (NIST), Gaithersburg, Maryland See http://csrc.nist.gov/rng/.
51. SCHOLLMEYER, M. F. AND TRANTER, W. H. 1991. Noise generators for the simulation of digital communication systems. In ANSS '91: Proceedings of the 24th Annual Symposium on Simulation. IEEE Computer Society Press, Los Alamitos, CA, 264-275.
52. TEICHROEW, D. 1953. Distribution sampling with high speed computers. (PhD thesis).
53. THOMAS, D. B. AND LUK, W 2006. Non-uniform random number generation through piecewise linear approximations. In International Conference on Field Programmable Logic and Applications.
54. WALKER, A. J. 1977. An efficient method for generation discrete random variables with general distribution. ACM Trans. Math. Softw. 3, 253-256.
55. WALLACE, C. 2005. Random number generators. Tech. rep., Monash University. See http://www.datamining.monash.edu.au/software/random/.
56. WALLACE, C. S. 1996. Fast pseudorandom generators for normal and exponential variates. ACM Trans. Math. Softw. 22, 1, 119-127.
57. WETHERILL, G. B. 1965. An approximation to the inverse normal function suitable for the generation of random normal deviates on electronic computers. Appl. Statis. 14, 2, 201-205.
58. WICHURA, M. J. 1988. Algorithm AS 241: The percentage points of the normal distribution. Appl. Statis. 37, 3, 477-484.
59. XILINX. 2002. Additive white Gaussian noise (AWGN) core. CoreGen documentation file.