Figures of merit for digital multistep pseudorandom numbers
- 1 April 1990
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 54 (190), 737-748
- https://doi.org/10.1090/s0025-5718-1990-1011436-4
Abstract
The statistical independence properties of s successive digital multistep pseudorandom numbers are governed by the figure of merit ρ ( s ) ( f ) {\rho ^{(s)}}(f) which depends on s and the characteristic polynomial f of the recursion used in the generation procedure. We extend previous work for s = 2 and describe how to obtain large figures of merit for s > 2 s > 2 , thus arriving at digital multistep pseudorandom numbers with attractive statistical independence properties. Tables of figures of merit for s = 3 , 4 , 5 s = 3,4,5 and degrees ≤ 32 \leq 32 are included.Keywords
This publication has 7 references indexed in Scilit:
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High PowersContemporary Mathematics, 1988
- Rational functions with partial quotients of small degree in their continued fraction expansionMonatshefte für Mathematik, 1987
- Point sets and sequences with small discrepancyMonatshefte für Mathematik, 1987
- Optimal characteristic polynomials for digital multistep pseudorandom numbersComputing, 1987
- The Performance ofk-Step Pseudorandom Number Generators under the Uniformity TestSIAM Journal on Scientific and Statistical Computing, 1984
- Quasi-Monte Carlo methods and pseudo-random numbersBulletin of the American Mathematical Society, 1978
- Random Numbers Generated by Linear Recurrence Modulo TwoMathematics of Computation, 1965