このエントリーをはてなブックマークに追加
ID 15034
本文ファイル
著者
Kurita, Yoshiharu
キーワード
GFSR
TGFSR
m-sequences
k-distribution
finite fields
NDC
数学
抄録(英)
The twisted GFSR generators proposed in a previous article have a defect in k-distribution for k larger than the order of recurrence. In this follow up article, we introduce and analyze a new TGFSR variant having better k-distribution property. We provide an efficient algorithm to obtain the order of equidistribution, together with a tight upper bound on the order. We discuss a method to search for generators attaining this bound, and we list some of these such generators. The upper bound turns out to be (sometimes far) less than the maximum order of equidistribution for a generator of that period length, but far more than that for a GFSR with a working area of the same size.
掲載誌名
ACM Transactions on Modeling and Computer Simulation
4巻
3号
開始ページ
254
終了ページ
266
出版年月日
1994-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.4 No.3 ; http://dx.doi.org/10.1145/189443.189445
関連情報URL(IsVersionOf)
http://dx.doi.org/10.1145/189443.189445
部局名
理学研究科