Twisted GFSR generators II
スポンサーリンク
概要
- 論文の詳細を見る
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の論文
ACM | 論文
- Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator
- Detecting defects in object-oriented designs : using reading techniques to increase software quality
- Twisted GFSR generators II
- Strong deviations from randomness in m-sequences based on trinomials
- Simple Cellular Automata as Pseudorandom m-Sequence Generators for Built-In Self-Test