このエントリーをはてなブックマークに追加
ID 15037
本文ファイル
著者
キーワード
generalized feedback shift registers
matrix linear congruential generators
m-sequences
TLP-sequences
GF(2m)
NDC
数学
抄録(英)
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
2巻
3号
開始ページ
179
終了ページ
194
出版年月日
1992-07
出版者
ACM
ISSN
1049-3301
NCID
出版者DOI
言語
英語
NII資源タイプ
学術雑誌論文
広大資料タイプ
学術雑誌論文
DCMIタイプ
text
フォーマット
application/pdf
著者版フラグ
author
権利情報
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
関連情報URL(IsVersionOf)
http://dx.doi.org/10.1145/146382.146383
部局名
理学研究科