ABSTRACT
Two or more multiplicative congruential random-number generators with prime modulus combined by means of a method proposed by Wichmann and Hill (1982) yield a random-number generator equivalent to a multiplicative congruential random-number generator with modulus equal to the product of the moduli of the component multiplicative congruential generators. The period of a random-number sequence obtained by the Wichmann-Hill method is equal to the least common multiple of the periods of the combined sequences. One of the two purposes of this paper is to present a necessary and sufficient set of efficiently verifiable conditions for the period to be equal to its maximum, which is the maximum of the least common multiple. Each of the conditions is always satisfied or is more easily verifiable when the modulus of each of the component generators is a safe prime. The other purpose of this paper is to derive an efficiently evaluatable formula for serial correlations of the maximum-period sequences by the Wichmann-Hill method. The authors recommend (i) to make the modulus of each of the component generators a safe prime, and (ii) to chose the multipliers of the components so as to (a) maximize the period and (b) make the serial correlations small in absolute value.
- Bratley, P., B. L. Fox, and L. E. Schrage. 1987. A guide to simulation. 2d ed. New York: Springer-Verlag. Google Scholar
Digital Library
- Conway, J. H., and N. J. A. Sloane. 1988. Sphere packings, lattices and groups. New York: Springer-Verlag. Google Scholar
Digital Library
- Coveyou, R. R., and R. D. MacPherson. 1967. Fourier analysis of uniform random number generators. Journal of the Association for Computing Machinery 14:100-119. Google Scholar
Digital Library
- Dieter, U., and J. Ahrens. 1971. An exact determination of serial correlations of pseudo-random numbers. Numerische Mathematik 17"101-123.Google Scholar
- Fincke, U., and M. Pohst. 1985. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Mathematics of Computation 44:463-471.Google Scholar
Cross Ref
- Fishman, G. S., and L. R. Moore III. 1986. An exhaustive analysis of multiplicative congruential random number generators with modulus 231 - 1. SlAM JournM on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics) 7:24-45. Google Scholar
Digital Library
- Grothe, H. 1988. Matrixgeneratoren zur Erzeugung gleichverteilter Pseudozufallsvektoren. Doctoral dissertation, Technische Hochschule Darmstadt, Germany. {Cited by L'Ecuyer (1992).}Google Scholar
- Knuth, D. E. 1969. The art of computer programming. Volume 2" Seminumerical algorithms. Reading, Massachusetts: Addison-Wesley. 2d ed., 1981. Google Scholar
Digital Library
- L'Ecuyer, P. 1992. Testing random number generators. In Proceedings of the 1902 Winter Simulation Conference, ed. J. J. Swain, D. Goldsman, R. C. Crain, and J. R. Wilson, 305-313. Institute of Electrical and Electronics Engineers, Piscataway, New Jersey. Google Scholar
Digital Library
- L'Ecuyer, P., and S. Tezuka. 1991. Structural properties for two classes of combined random number generators. Mathematics of Computation 57:735-746.Google Scholar
Cross Ref
- Leech, J. 1967. Notes on sphere packings. Canadian Journal of Mathematics 19:251-267.Google Scholar
Cross Ref
- Marsaglia, G. 1968. Random numbers fall mainly in the planes. Proceedings of the National Academy of Sciences of the United States of America 61:25-28.Google Scholar
Cross Ref
- Marsaglia, G., and A. Zaman. 1994. Some portable very-long-period random number generators. Computers in Physics 8"117-121. Google Scholar
Digital Library
- Niederreiter, H. 1992. Random number generation and quasi-Monte Carlo methods. Philadelphia, Pennsylvania: Society for Industrial and Applied Mathematics. Google Scholar
Digital Library
- Rogers, C. A. 1958. The packing of equal spheres. Proceedings of the London Mathematical Society, series 3, 8:609-620.Google Scholar
Cross Ref
- Wichmann, B. A., and I. D. Hill. 1982. Algorithm AS 183: An efficient and portable pseudo-random number generator. Applied Statistics 31:188-190. Corrected in the same journal 33:123.Google Scholar
Cross Ref
- Zeisel, H. 1986. A remark on "Algorithm AS 183: An efficient and portable pseudo-random number generator." Applied Statistics 35:89.Google Scholar
Index Terms
Combination of multiplicative congruential random-number generators with safe prime modulus
Recommendations
Multiplicative, congruential random-number generators with multiplier ± 2k1 ± 2k2 and modulus 2p - 1
The demand for random numbers in scientific applications is increasing. However, the most widely used multiplicative, congruential random-number generators with modulus 231 - 1 have a cycle length of about 2.1 × 109. Moreover, developing portable and ...
A Uniform Random Number Generator Based on the Combination of Two Congruential Generators
A method of generating pseudo-random uniform numbers based on the combination of two congruential generators is described. It retains two of the desirable features of congruential generators, namely, the long cycle and the case of implementation on a ...
Bit-Wise Behavior of Random Number Generators
In 1985, G. Marsaglia proposed the m-tuple test, a runs test on bits, as a test of nonrandomness of a sequence of pseudorandom integers. We try this test on the outputs from a large set of pseudorandom number generators and discuss the behavior of the ...






Comments