WEKO3
アイテム
Twisted GFSR generators
https://hiroshima.repo.nii.ac.jp/records/2006122
https://hiroshima.repo.nii.ac.jp/records/2006122076e71da-c634-4746-a922-c81999a7dc06
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
ACMTraModel_2_179.pdf (176.4 KB)
|
| Item type | デフォルトアイテムタイプ_（フル）(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2023-03-18 | |||||||
| タイトル | ||||||||
| タイトル | Twisted GFSR generators | |||||||
| 言語 | en | |||||||
| 作成者 |
Matsumoto, Makoto
× Matsumoto, Makoto
|
|||||||
| アクセス権 | ||||||||
| アクセス権 | open access | |||||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||||
| 権利情報 | ||||||||
| 権利情報 | Copyright (c) 1998 ACM. This is the author version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Modeling and Computer Simulation,Vol.2 No.3 ; http://dx.doi.org/10.1145/146382.146383 | |||||||
| 主題 | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | generalized feedback shift registers | |||||||
| 主題 | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | matrix linear congruential generators | |||||||
| 主題 | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | m-sequences | |||||||
| 主題 | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | TLP-sequences | |||||||
| 主題 | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | GF(2m) | |||||||
| 主題 | ||||||||
| 主題Scheme | NDC | |||||||
| 主題 | 410 | |||||||
| 内容記述 | ||||||||
| 内容記述 | 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. | |||||||
| 言語 | en | |||||||
| 出版者 | ||||||||
| 出版者 | ACM | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 出版タイプ | ||||||||
| 出版タイプ | AO | |||||||
| 出版タイプResource | http://purl.org/coar/version/c_b1a7d7d4d402bcce | |||||||
| 関連情報 | ||||||||
| 識別子タイプ | DOI | |||||||
| 関連識別子 | 10.1145/146382.146383 | |||||||
| 関連情報 | ||||||||
| 関連タイプ | isVersionOf | |||||||
| 識別子タイプ | DOI | |||||||
| 関連識別子 | http://dx.doi.org/10.1145/146382.146383 | |||||||
| 収録物識別子 | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1049-3301 | |||||||
| 収録物識別子 | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA10779230 | |||||||
| 開始ページ | ||||||||
| 開始ページ | 179 | |||||||
| 書誌情報 |
ACM Transactions on Modeling and Computer Simulation ACM Transactions on Modeling and Computer Simulation 巻 2, 号 3, p. 179-194, 発行日 1992-07 |
|||||||
| 旧ID | 15037 | |||||||
