Abstract
This study discusses and presents some comments on a portable random number generator of very large period based on a generalised multi-moduli congruential method. It also shows that by using 50 generators it is possible to extend the period to 1.01*10105 in a 16 bit machine and by 100 generators to 1.39* 10592 in a 32 bit machine. For each linear congruential parent generator a prime modulus is determined to achieve the maximum period and the best multiplier is found by applying Spectral Test. Some weaknesses and problems are pointed out.
- Deng L. Y. and George E. O. (1990). Generation of Uniform Variates From Several Nearly Uniformly Distributed Variables. Commun. Statist. - Simula., Vol. 19, No. 1, pp. 145--154.Google Scholar
Cross Ref
- Guinier D. (1988). A Fast and Portable Uniform Quasi-Random Generator of Very Large Period Based on a Generalized Multi-Moduli Congruential Method. Simulation Digest. Vol. 19, No. 3, pp. 27--33. Google Scholar
Digital Library
- Hopkins T. R. (1983). A Revised Algorithm for the Spectral Test. Applied Statistics, Vol. 32, pp. 328--335.Google Scholar
Cross Ref
- Knuth D. E. (1981). The Art of Computer Programming, Vol. 2, Semi-Numerical Algorithms. Addison-Wesley. Google Scholar
Digital Library
- Marsaglia G. (1968). Random Numbers Fall Mainly in the Planes. Proc. Nat. Acad. Sci. U.S.A., Vol. 65, pp. 25--28.Google Scholar
Cross Ref
- McLeod A. I. (1985). A Remark on AS 183. An Efficient and Portable Pseodorandom Number Generator. Applied Statistics. Vol. 34, pp. 198--200.Google Scholar
Cross Ref
- Wichmann B. A. and Hill I. D. (1982). An Efficient and Portable Pseodorandom Number Generator. Applied Statistics. Vol. 31, pp. 188--190.Google Scholar
Cross Ref
Index Terms
On a fast and portable uniform quasi-random number generator
Recommendations
Uniform Random Number Generator Using Leap Ahead LFSR Architecture
ICCCS '09: Proceedings of the 2009 International Conference on Computer and Communications SecurityUniform Random Number Generator (URNG) is a key element in most applications which run on FPGA based hardware accelerators. As multi-bits is required and a normal LFSR could only generate one bit per cycle, more than one LFSR is needed in a URNG. In ...
Extremely portable random number generator
Extremely portable subroutines are sometimes needed for which moderate quality and efficiency suffice. Typically, this occurs for library functions (like random number generation and incore sorting) which are not entirely universal or are not used in a ...
A portable random number generator well suited for the rejection method
Up to now, all known efficient portable implementations of linear congruential random number generators with modulus 231 – 1 have worked only with multipliers that are small compared with the modulus. We show that for nonuniform distributions, the ...





Comments