Affiliation:
1. Univ. of Economics and Business Administration, Vienna, Austria
Abstract
Up to now, all known efficient portable implementations of linear congruential random number generators with modulus 2
31
– 1 have worked only with multipliers that are small compared with the modulus. We show that for nonuniform distributions, the rejection method may generate random numbers of bad qualify if combined with a linear congruential generator with small multiplier. A method is described that works for any multiplier smaller than 2
30
. It uses the decomposition of multiplier and seed in high-order and low-order bits to compute the upper and lower half of the product. The sum of the two halfs gives the product of multiplier and seed modulo 2
21
– 1. Coded in ANSI-C and FORTRAN77 the method results in a portable implementation of the linear congruential generator that is as fast or faster than other portable methods.
Publisher
Association for Computing Machinery (ACM)
Subject
Applied Mathematics,Software
Reference11 articles.
1. An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
2. Matrix generators for pseudo-random vector generation;GROTHE H.;Stattstical Papers,1987
3. KNUTU D. E. 1981. The Art of Computer Programmmg Vol. H Addison-Wesley Menlo Park London Amsterdam Don Mills Sydney. KNUTU D. E. 1981. The Art of Computer Programmmg Vol. H Addison-Wesley Menlo Park London Amsterdam Don Mills Sydney.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献