skip to main content
article
Free Access

Generalized Feedback Shift Register Pseudorandom Number Algorithm

Authors Info & Claims
Published:01 July 1973Publication History
Skip Abstract Section

Abstract

The generalized feedback shift register pseudorandom number algorithm has several advantages over all other pseudorandom number generators. These advantages are: (1) it produces multidimensional pseudorandom numbers; (2) it has an arbitrarily long period independent of the word size of the computer on which it is implemented; (3) it is faster than other pseudorandom number generators; (4) the “same” floating-point pseudorandom number sequence is obtained on any machine, that is, the high order mantissa bits of each pseudorandom number agree on all machines— examples are given for IBM 360, Sperry-Rand-Univac 1108, Control Data 6000, and Hewlett-Packard 2100 series computers; (5) it can be coded in compiler languages (it is portable); (6) the algorithm is easily implemented in microcode and has been programmed for an Interdata computer.

References

  1. 1 COVEYOU, R. R., AND MAcPHERSON, R.D. Fourier analyms of uniform random number generators J. ACM 14, 1 (Jan 1967), 100-119. Google ScholarGoogle Scholar
  2. 2 KENDALL, M. G., AND SMITH, B. B. Randomness and random samphng numbers J Roy Statist. Soc 10I (1938), 162-164.Google ScholarGoogle Scholar
  3. 3 LEwis, P. A W, GOODMAN, A S, AND MILLER, J. M A pseudorandom number generator for the SYSTEM/360 IBM Syst. J. 8, 2 (1969), 136-146.Google ScholarGoogle Scholar
  4. 4 M:ACLAREN, M D, AND MARSAGLIA, G. Uniform random number generators. J.ACM 12, 1 (1965), 83-89. Google ScholarGoogle Scholar
  5. 5 MARSAGLIA, G. Random numbers fall mainly on the planes. Proc Nat. Acad. Sc~. 61, 1 (Sept 1968), 25-28.Google ScholarGoogle Scholar
  6. 6 PAYNE, W. H, AND LEWIS, T. G Conditional bit sampling: Accuracy and speed In Mathematzcal Software, J. R. Rice (Ed), Academic, New York, 1971, pp 331-345.Google ScholarGoogle Scholar
  7. 7 TAUSWORTHE, R. C Random numbers generated by linear recurrence modulo two Malh. Compul 19 (1965), 201-209.Google ScholarGoogle Scholar
  8. 8 TOOTILL, J P. R., ROBINSON, W. D, AND ADAMS, A G The runs up-and-down periormance of Tausworthe pseudo-random number generators. J ACM 18, 3 (1971), 381-399. Google ScholarGoogle Scholar
  9. 9 TOOTILL, j. P. R, ROnINSON: W. D, AND EAGLE, D.J. An asymptotlcally random Tausworthe sequence. J. ACM 20, 3 (July 1973), 469-481 (thin issue) Google ScholarGoogle Scholar
  10. 10 WHITTLESEY, J RB. A comparlson of the correlational behavior of random number generators for the IBM 360. Comm A CM I1, 9 (Sept 1968), 641-644 Google ScholarGoogle Scholar
  11. 11 WHITTLESEY, J. RB., AND GI~IESL, P. Multi-dimensional pseudorandom non-uniformity. Proc. of the UMR-Mervln J Kelly Communication Conference, Oct. 1970, U. of Missouri at Rolla, Rolla, Mo, pp. 15-4-1-15-4-6Google ScholarGoogle Scholar
  12. 12 ZIERLER, N. Prm~tive trinomlals whose degree is a Merseime exponent. Inform Contr. 15 (1969), 67-69.Google ScholarGoogle Scholar
  13. 13 ZIERLER, N , AND BRILLHART, J. On primitive trmommls (mod 2), II. Inform. Contr. I4 (1969), 566-569Google ScholarGoogle Scholar

Index Terms

  1. Generalized Feedback Shift Register Pseudorandom Number Algorithm

      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 20, Issue 3
        July 1973
        175 pages
        ISSN:0004-5411
        EISSN:1557-735X
        DOI:10.1145/321765
        Issue’s Table of Contents

        Copyright © 1973 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 July 1973
        Published in jacm Volume 20, Issue 3

        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
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!