On the discrepancy of GFSR pseudorandom numbers
- 1 October 1987
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 34 (4) , 939-949
- https://doi.org/10.1145/31846.31848
Abstract
A new summation formula based on the orthogonal property of Walsh functions is devised. Using this formula, the k -dimensional discrepancy of the generalized feedback shift register (GFSR) pseudorandom numbers is derived. The relation between the discrepancy and k -distribution of GFSR sequences is also obtained. Finally the definition of optimal GPSR pseudorandom number generators is introduced.Keywords
This publication has 8 references indexed in Scilit:
- Walsh-spectral test for GFSR pseudorandom numbersCommunications of the ACM, 1987
- The Performance ofk-Step Pseudorandom Number Generators under the Uniformity TestSIAM Journal on Scientific and Statistical Computing, 1984
- The k -distribution of generalized feedback shift register pseudorandom numbersCommunications of the ACM, 1983
- Optimal multipliers for pseudo-random number generation by the linear congruential methodBIT Numerical Mathematics, 1983
- Quasi-Monte Carlo methods and pseudo-random numbersBulletin of the American Mathematical Society, 1978
- Pseudo-random numbers and optimal coefficientsAdvances in Mathematics, 1977
- Generalized Feedback Shift Register Pseudorandom Number AlgorithmJournal of the ACM, 1973
- Random numbers generated by linear recurrence modulo twoMathematics of Computation, 1965