Abstract
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.
Keywords
Computer scienceRandom number generationGenerator (circuit theory)Pseudorandom number generatorLinear congruential generatorMultiplicative functionSimple (philosophy)ArithmeticSequence (biology)AlgorithmRandom seedMathematicsPower (physics)
Affiliated Institutions
Related Publications
The context-tree weighting method: basic properties
Describes a sequential universal data compression procedure for binary tree sources that performs the "double mixture." Using a context tree, this method weights in an efficient...
Distributed Representations of Words and Phrases and their Compositionality
The recently introduced continuous Skip-gram model is an efficient method for learning high-quality distributed vector representations that capture a large number of precise syn...
Some methods for classification and analysis of multivariate observations
This paper describes a number of applications of the 'k-means', a procedure for classifying a random sample of points in E sub N. The procedure consists of starting with k group...
Optimal alignments in linear space
Space, not time, is often the limiting factor when computing optimal sequence alignments, and a number of recent papers in the biology literature have proposed space-saving stra...
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the 'learning...
Publication Info
- Year
- 1988
- Type
- article
- Volume
- 31
- Issue
- 6
- Pages
- 742-751
- Citations
- 482
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
482
OpenAlex
24
Influential
Cite This
Pierre L’Ecuyer
(1988).
Efficient and portable combined random number generators.
Communications of the ACM
, 31
(6)
, 742-751.
https://doi.org/10.1145/62959.62969
Identifiers
- DOI
- 10.1145/62959.62969