Generalized Feedback Shift Register Pseudorandom Number Algorithm

  • T. G. Lewis
    Computer Science Department, University of Missouri at Rolla, Rolla, MO
  • W. H. Payne
    Computer Science Department and Computing Center, Washington State University, Pullman, WA

この論文をさがす

説明

<jats:p>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.</jats:p>

収録刊行物

  • Journal of the ACM

    Journal of the ACM 20 (3), 456-468, 1973-07

    Association for Computing Machinery (ACM)

被引用文献 (13)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ