Twisted GFSR generators

• Matsumoto, Makoto

抄録

The generalized feedback shift register(GFSR) algorithm suggested by Lewis and Payne is a widely used pseudorandom number generator, but has the following serious drawbacks: 1. Aninitialization scheme to assure higher order equidistribution is involved and is time-consuming. 2. Each bit of the generated words constitutes an m-sequence based on a primitive trinomial, which shows poor randomness with respect to weight distribution. 3. Large working area is necessary. 4. The period of sequence is far shorter than the theoretical upper bound. This paper presents the twisted GFSR(TGFSR) algorithm, as lightly but essentially modified version of the GFSR, which solves all the above problems without loss of merit. Some practical TGFSR generators were implemented and they passed strict empirical tests. These new generators are most suitable for simulation of a large distributive system, which requires a number of mutually independent pseudorandom number generators with compact size.

収録刊行物

• ACM Transactions on Modeling and Computer Simulation

  ACM Transactions on Modeling and Computer Simulation 2 (3), 179-194, 1992-07

  ACM

キーワード

• generalized feedback shift registers
• matrix linear congruential generators
• m-sequences
• TLP-sequences
• GF(2m)

詳細情報

• CRID: 1050859215941526656
• NII論文ID: 120000882413
• NII書誌ID: AA10779230
• Web Site: http://ir.lib.hiroshima-u.ac.jp/00015037
• 本文言語コード: en
• 資料種別: journal article
• データソース種別:
  • IRDB
  • CiNii Articles