このエントリーをはてなブックマークに追加
ID 15034
file
creator
Kurita, Yoshiharu
subject
GFSR
TGFSR
m-sequences
k-distribution
finite fields
NDC
Mathematics
abstract
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.
journal title
ACM Transactions on Modeling and Computer Simulation
volume
Volume 4
issue
Issue 3
start page
254
end page
266
date of issued
1994-07
publisher
ACM
issn
1049-3301
ncid
publisher doi
language
eng
nii type
Journal Article
HU type
Journal Articles
DCMI type
text
format
application/pdf
text version
author
rights
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
relation is version of URL
http://dx.doi.org/10.1145/189443.189445
department
Graduate School of Science