Fast linear congruential pseudorandom number generators using the Messerschmitt pipelining transformation

1992 ◽  
Vol 139 (2) ◽  
pp. 131 ◽  
Author(s):  
N. Burgess ◽  
K.V. Lever
2008 ◽  
Vol 04 (06) ◽  
pp. 1009-1018
Author(s):  
EDWIN D. EL-MAHASSNI ◽  
DOMINGO GOMEZ

Nonlinear congruential pseudorandom number generators can have unexpectedly short periods. Shamir and Tsaban introduced the class of counter-dependent generators which admit much longer periods. In this paper, using a technique developed by Niederreiter and Shparlinski, we present discrepancy bounds for sequences of s-tuples of successive pseudorandom numbers generated by counter-dependent generators modulo a composite M.


Sign in / Sign up

Export Citation Format

Share Document