skip to main content
article
Free Access

Mixed Congruential Random Number Generators for Binary Machines

Authors Info & Claims
Published:01 January 1964Publication History
Skip Abstract Section

Abstract

Random number generators of the mixed congruential type have recently been proposed. They appear to have some advantages over those of the multiplicative type, except that their statistical behavior is unsatisfactory in some cases. It is shown theoretically that a certain class of these mixed generators should be expected to fail statistical tests for randomness. Extensive testing confirms this hypothesis and makes possible a more precise definition of the unsatisfactory class. It is concluded that the advantages of mixed generators can be realized only in special circumstances. On machines with relatively short multiplication times the multiplicative generators are to be preferred.

References

  1. 1 ALLARD, J. L., DOBELL, A. R., AND HULL, W.E. Mixed congruential random number generators for decimal machines. J. ACM 10 (1963), 131-141. Google ScholarGoogle Scholar
  2. 2 Covvov, R. R. Serial correlation in the generation of pseudo-random numbers. J. ACM 7 (1960), 72-74. Google ScholarGoogle Scholar
  3. 3 GOOD, 1. J. The serial test for sampling numbers and other tests for randomness. Proc. Camb. Phil. Soc. 49 (1953), 276-284.Google ScholarGoogle Scholar
  4. 4 GOOD, I .J . On the serial test for random sequences. Ann. Math. Stat. 28 (1957), 262-264.Google ScholarGoogle Scholar
  5. 5 GREENBRGER, MARTXN. Notes on a new pseudo-random number generator. J. ACM 8 (1961), 163-167. Google ScholarGoogle Scholar
  6. 6 GREENBEIGER, MARTIN. An a priori determination of serial correlation in computer generated random numbers. Math. Comp. 15 (1961), 383-389. See also: corrigenda, Math. Comp. 16 (1962), 126 and 406.Google ScholarGoogle Scholar
  7. 7 HULL, W. E., AND DO,ELL, A.R. Random number generators. SIAM Rev. 4 (1962), 230-254.Google ScholarGoogle Scholar
  8. 8 KUEHN, HEIDI G. A 48-bit pseudo-random number generator. Comm. ACM 4 (1961), 350-352. Google ScholarGoogle Scholar
  9. 9 PEACH, PAUL. Bias in pseudo-random numbers. J. Am. Stat. Assoc. 56 (1961), 610-618.Google ScholarGoogle Scholar
  10. 10 ROTENBERG, A. A new pseudo-random number generator. J. ACM 7 (1960), 75-77. Google ScholarGoogle Scholar
  11. 11 THOMSON, W. E. A modified congruence method of generating pseudo-random numbers. Comput. J. 1 (1958), 83 and 86.Google ScholarGoogle Scholar

Index Terms

  1. Mixed Congruential Random Number Generators for Binary Machines

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image Journal of the ACM
      Journal of the ACM  Volume 11, Issue 1
      Jan. 1964
      116 pages
      ISSN:0004-5411
      EISSN:1557-735X
      DOI:10.1145/321203
      Issue’s Table of Contents

      Copyright © 1964 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 January 1964
      Published in jacm Volume 11, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader