Coding and information theory (2nd ed.)
Coding and information theory (2nd ed.)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Fourier Analysis of Uniform Random Number Generators
Journal of the ACM (JACM)
A More Portable Fortran Random Number Generator
ACM Transactions on Mathematical Software (TOMS)
ACM Computing Surveys (CSUR)
Coding the Lehmer pseudo-random number generator
Communications of the ACM
Extremely portable random number generator
Communications of the ACM
On the Generation of Cryptographically Strong Pseudo-Random Sequences
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Random numbers for stochastic simulation
ACM SIGBIO Newsletter
ACM SIGSAC Review
A fast uniform astronomical random number generator
ACM SIGSAC Review
On a fast and portable uniform quasi-random number generator
ACM SIGSIM Simulation Digest
| Hi-index | 0.00 |
The present method generates machine-Independent uniform random sequences of real numbers in the interval (0.,1.) excluding 1. It uses a generalization of mulltiplicative linear gongruential generators working with prime numbers as moduli whose values have been fixed according to the positive integer arithmetic storage available from the system, and one or their corresponding primitive elements as multipliers to complete independently each full cycle.The periodicity can be considered as infinite: O (1092) for a 16-bit machine and O (10174) for a 32-bit machine and their respective integer arithmetic; the periodicity can be adjusted if it is required by the user in the normal version or statistically reaching the maximum in the enhanced 'stagger' version.An implementation of the method is available in the form of structured Fortran 77 functions and gives bettr results in term of velocity and periodicity than the other transportable functions compared with good quality of randomness.