Maximally equidistributed combined Tausworthe generators
Open Access
- 1 January 1996
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 65 (213) , 203-213
- https://doi.org/10.1090/s0025-5718-96-00696-5
Abstract
Tausworthe random number generators based on a primitive trinomial allow an easy and fast implementation when their parameters obey certain restrictions. However, such generators, with those restrictions, have bad statistical properties unless we combine them. A generator is called maximally equidistributed if its vectors of successive values have the best possible equidistribution in all dimensions. This paper shows how to find maximally equidistributed combinations in an efficient manner, and gives a list of generators with that property. Such generators have a strong theoretical support and lend themselves to very fast software implementations.Keywords
This publication has 11 references indexed in Scilit:
- Uniform random number generationAnnals of Operations Research, 1994
- On the Distribution of k-Dimensional Vectors for Simple and Combined Tausworthe SequencesMathematics of Computation, 1993
- On the Use of Reducible Polynomials as Random Number GeneratorsMathematics of Computation, 1993
- The hierarchy of correlations in random binary sequencesJournal of Statistical Physics, 1991
- Efficient and portable combined Tausworthe random number generatorsACM Transactions on Modeling and Computer Simulation, 1991
- Efficient and portable combined random number generatorsCommunications of the ACM, 1988
- An Asymptotically Random Tausworthe SequenceJournal of the ACM, 1973
- On primitive trinomials (mod 2), IIInformation and Control, 1969
- An analysis of the pseudo-randomness properties of subsequences of longm-sequencesIEEE Transactions on Information Theory, 1968
- Random Numbers Generated by Linear Recurrence Modulo TwoMathematics of Computation, 1965