Uniform Random Numbers

1983 ◽  
pp. 180-213
Author(s):  
Paul Bratley ◽  
Bennett L. Fox ◽  
Linus E. Schrage
2009 ◽  
Vol 9 (22) ◽  
pp. 4071-4075 ◽  
Author(s):  
R. Ayanzadeh ◽  
K. Hassani ◽  
Y. Moghaddas ◽  
H. Gheiby ◽  
S. Setayeshi

Author(s):  
A.F. Deon ◽  
V.A. Onuchin ◽  
Yu.A. Menyaev

Various pseudorandom number generation algorithms may be used to create a discrete stochastic plane. If a Cartesian completeness property is required of the plane, it must be uniform. The point is, employing the concept of uncontrolled random number generation may yield low-quality results, since original sequences may omit random numbers or not be sufficiently uniform. We present a novel approach for generating stochastic Cartesian planes according to the model of complete twister sequences featuring uniform random numbers without omissions or repetitions. Simulation results confirm that the random planes obtained are indeed perfectly uniform. Moreover, recombining the original complete uniform sequence parameters allows the number of planes created to be significantly increased without using any extra random access memory.


1973 ◽  
Vol 4 (4) ◽  
pp. 17-17
Author(s):  
William R. Franta

1976 ◽  
Vol 8 (1) ◽  
pp. 34-35
Author(s):  
William R. Franta

Sign in / Sign up

Export Citation Format

Share Document