Abstract
Two types of linear congruential random number generator are considered: the conventional one using integer arithmetic and another using polynomial arithmetic over finite fields. We show that most of the long-period random number generators currently used or recently proposed, which include multiple recursive generators, shift register generators, add-with-carry and subtract-with-borrow generators, Twisted-GFSR generators, Wichmann-Hill generators, and combined Tausworthe generators, can be viewed as producing truncated linear congruential sequences with large moduli in terms of integer or polynomial arithmetic. On this basis, we compare the above generators with respect, to generation efficiency, lattice structure, and portability.
Keywords
Random number generationMathematicsLinear congruential generatorGenerator (circuit theory)Integer (computer science)Pseudorandom number generatorArithmeticDiscrete mathematicsShift registerNumber theoryPolynomialComputer scienceAlgorithmPower (physics)
Affiliated Institutions
Related Publications
Efficient and portable combined random number generators
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, ...
A distribution function approach to rainfall runoff modeling
This paper begins with a critique of existing rainfall runoff models and proceeds to a largely new formulation in which the single store (representing, for example, interception...
Publication Info
- Year
- 1994
- Type
- article
- Volume
- 37
- Issue
- 3
- Pages
- 211-227
- Citations
- 8
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
8
OpenAlex
Cite This
Shu Tezuka
(1994).
A UNIFIED VIEW OF LONG-PERIOD RANDOM NUMBER GENERATORS.
Journal of the Operations Research Society of Japan
, 37
(3)
, 211-227.
https://doi.org/10.15807/jorsj.37.211
Identifiers
- DOI
- 10.15807/jorsj.37.211