The present paper deals with the compound general nonlinear congruential method for generating uniform pseudorandom numbers, which has been introduced recently. Equidistribution and statistical independence properties of the generated sequences over parts of the period are studied based on the discr
Parallel Streams of Nonlinear Congruential Pseudorandom Numbers
✍ Scribed by Jürgen Eichenauer-Herrmann; Harald Niederreiter
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 249 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
✦ Synopsis
This paper deals with the general nonlinear congruential method for generating uniform pseudorandom numbers, in which permutation polynomials over finite prime fields play an important role. It is known that these pseudorandom numbers exhibit an attractive equidistribution and statistical independence behavior. In the context of parallelized simulation methods, a large number of parallel streams of pseudorandom numbers with strong mutual statistical independence properties are required. In the present paper, such properties of parallelized nonlinear congruential generators are studied based on the discrepancy of certain point sets. Upper and lower bounds for the discrepancy both over the full period and over (sufficiently large) parts of the period are established. The method of proof rests on the classical Weil bound for exponential sums.
📜 SIMILAR VOLUMES
The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. In this paper we present a new type of discrepancy bound for sequences of s-tuples of successive nonlinear congruential pseudorandom numbers and a result on