Twisted GFSR generators II
- 1 July 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 4 (3) , 254-266
- https://doi.org/10.1145/189443.189445
Abstract
The twisted GFSR generators proposed in a previous article have a defect in k -distribution for k larger than the order of recurrence. In this follow up article, we introduce and analyze a new TGFSR variant having better k -distribution property. We provide an efficient algorithm to obtain the order of equidistribution, together with a tight upper bound on the order. We discuss a method to search for generators attaining this bound, and we list some of these such generators. The upper bound turns out to be (sometimes far) less than the maximum order of equidistribution for a generator of that period length, but far more than that for a GFSR with a working are of the same size.Keywords
This publication has 6 references indexed in Scilit:
- Uniform random number generationAnnals of Operations Research, 1994
- Twisted GFSR generatorsACM Transactions on Modeling and Computer Simulation, 1992
- Random number generation with the recursion Xt = Xt−3p ⊕ Xt−3qJournal of Computational and Applied Mathematics, 1990
- The k -distribution of generalized feedback shift register pseudorandom numbersCommunications of the ACM, 1983
- Pseudo-randomness properties of binary shift register sequences (Corresp.)IEEE Transactions on Information Theory, 1975
- An Asymptotically Random Tausworthe SequenceJournal of the ACM, 1973