Efficient and portable combined random number generators

P L'ecuyer - Communications of the ACM, 1988 - dl.acm.org
Communications of the ACM, 1988dl.acm.org
In this paper we present an efficient way to combine two or more Multiplicative Linear
Congruential Generators (MLCGs) and propose several new generators. The individual
MLCGs, making up the proposed combined generators, satisfy stringent theoretical criteria
for the quality of the sequence they produce (based on the Spectral Test) and are easy to
implement in a portable way. The proposed simple combination method is new and
produces a generator whose period is the least common multiple of the individual periods …
In this paper we present an efficient way to combine two or more Multiplicative Linear Congruential Generators (MLCGs) and propose several new generators. The individual MLCGs, making up the proposed combined generators, satisfy stringent theoretical criteria for the quality of the sequence they produce (based on the Spectral Test) and are easy to implement in a portable way. The proposed simple combination method is new and produces a generator whose period is the least common multiple of the individual periods. Each proposed generator has been submitted to a comprehensive battery of statistical tests. We also describe portable implementations, using 16-bit or 32-bit integer arithmetic. The proposed generators have most of the beneficial properties of MLCGs. For example, each generator can be split into many independent generators and it is easy to skip a long subsequence of numbers without doing the work of generating them all.
ACM Digital Library