Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/twisted-gfsr-generators-ii-WdSfnz00Dc
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1994 by ACM Inc.
- ISSN
- 1049-3301
- DOI
- 10.1145/189443.189445
- Publisher site
- See Article on Publisher Site
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 are of the same size.
Journal
ACM Transactions on Modeling and Computer Simulation (TOMACS) – Association for Computing Machinery
Published: Jul 1, 1994