Abstract
The familiar multiplicative congruential generator is examined in the context of the type of two's complement arithmetic used in the IBM 360 series. Different sequences of residues are considered and relationships established among them. It is shown that a sequence of positive and negative residues may be produced more simply and econimically than with the conventional approach and yet have twice the period of the latter without loss of desirable statistical properties. Another easily generated sequence involving absolute values is also shown to have twice the period but with the less attractive statistical properties. The statistical properties of these sequences are given and related to previously established criteria.
- 1 CERTAINE, J. E. On sequences of pseudo-random numbers of maximal length. J. ACM 5, 4 (Oct. 1958), 353-356.]] Google Scholar
Digital Library
- 2 COVEYOU, R.R. Serial correlation in the generation of pseudorandom numbers. J. ACM 7, 1 (Jan. 1960), 72-74.]] Google Scholar
Digital Library
- 3 -- AND MACPHERSON, R. D. Fourier analysis of random number generators. J. ACM 15, 1 (Jan. 1967), 100-119.]] Google Scholar
Digital Library
- 4 GREENBERGER, MARTIN. Notes on a new pseudo-random number generator. J. ACM 8, 2 (Apr. 1961), 163-167.]] Google Scholar
Digital Library
- 5 --. An a priori determination of serial correlation in computer generated random numbers. Math. Comput. 15, (1961), 383-389.]]Google Scholar
Cross Ref
- 6 HULL, W. E., ANn DOBELL, A.R. Random number generators. SIAM Rev. 4 (1962), 230-254.]]Google Scholar
Cross Ref
- 7 IBM System/360 principles of operation. File No. S360-01, Form A22-6821-2, IBM Corp., Feb. 1966.]] Google Scholar
Digital Library
- 8 MISTIC programming manual. Michigan State U., Ann Arbor, Mich., Mar. 17, 1958.]]Google Scholar
- 9 System/360 scientific subroutine package, (360A-CM-03X) version III. No. H20-0205-3, IBM Corp., 1968.]]Google Scholar
- 10 USPENSKY, J. V., AND HEASLET, M. A. Elementary Number Theory. McGraw-Hill, New York, 1939.]]Google Scholar
Index Terms
Generating pseudorandom numbers on a two's complement machine such as the IBM 360
Recommendations
A New Approach to Analysis and Design of Chaos-Based Random Number Generators Using Algorithmic Converter
This paper presents a new approach to analysis and design of ADC-based random number generators. To this end, different full-bit and half-bit redundant stages of algorithmic converter are used to design chaotic maps. It is shown that, in the redundant ...
LXM: better splittable pseudorandom number generators (and almost as fast)
In 2014, Steele, Lea, and Flood presented SplitMix, an object-oriented pseudorandom number generator (prng) that is quite fast (9 64-bit arithmetic/logical operations per 64 bits generated) and also splittable. A conventional prng object provides a ...
Fast splittable pseudorandom number generators
OOPSLA '14We describe a new algorithm SplitMix for an object-oriented and splittable pseudorandom number generator (PRNG) that is quite fast: 9 64-bit arithmetic/logical operations per 64 bits generated. A conventional linear PRNG object provides a generate ...






Comments