Improved long-period generators based on linear recurrences modulo 2

@article{Panneton2004ImprovedLG,
  title={Improved long-period generators based on linear recurrences modulo 2},
  author={François Panneton and Pierre L’Ecuyer and Makoto Matsumoto},
  journal={ACM Trans. Math. Softw.},
  year={2004},
  volume={32},
  pages={1-16},
  url={https://api.semanticscholar.org/CorpusID:7368302}
}
This article proposes new generators of that form with better equidistribution and “bit-mixing” properties for equivalent period length and speed and illustrates how this can reduce the impact of persistent dependencies among successive output values, which can be observed in certain parts of the period of gigantic generators such as the Mersenne twister.
View on ACM
ir.lib.hiroshima-u.ac.jp
262 Citations
Highly Influential Citations
21
Background Citations
81
Methods Citations
75
Results Citations
3

Figures and Tables from this paper

262 Citations

Fast random number generators based on linear recurrences modulo 2: overview and comparison

This paper reviews the most interesting construction methods for random number generators based on linear recurrences modulo 2, examine their theoretical and empirical properties, and make comparisons.

F2-Linear Random Number Generators

The most interesting construction methods for random number generators based on linear recurrences modulo 2 are reviewed, their theoretical and empirical properties are examined, the relevant computational tools and algorithms are described, and comparisons are made.

F 2-Linear Random Number Generators

The most interesting construction methods for random number generators based on linear recurrences modulo 2 are reviewed, their theoretical and empirical properties are examined, the relevant computational tools and algorithms are described, and comparisons are made.

Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers

A pseudorandom bit generator using chaotic true orbits of the Bernoulli map on real cubic algebraic integers having complex conjugates is developed and upper bounds concerning the growth of the representation of points on a true orbit are given.

Efficient Jump Ahead for 2-Linear Random Number Generators

This paper provides a faster algorithm to jump ahead by a large number of steps in a linear recurrence modulo 2 that uses much less than the k2 bits of memory required by the matrix method.

2 F 2-Linear Generators 2 . 1 General Framework

The most interesting construction methods for random number generators based on linear recurrences modulo 2 are reviewed, their theoretical and empirical properties are examined, the relevant computational tools and algorithms are described, and comparisons are made.

On the F2-linear relations of Mersenne Twister pseudorandom number generators

On the fast generation of long-period pseudorandom number sequences

This work develops optimized, resource-efficient parallel architectures for long-period PRNGs that generate multiple independent streams by exploiting the underlying algorithm as well as hardware-specific architectural features.

An efficient lattice reduction method for F2-linear pseudorandom number generators using Mulders and Storjohann algorithm

Resolution-stationary random number generators

...

39 References

Construction of Equidistributed Generators Based on Linear Recurrences Modulo 2

Random number generators based on linear recurrences modulo 2 are widely used and appear in different forms, such as the simple and combined Tausworthe generators, the GFSR, and the twisted GFSR…

Twisted GFSR generators II

This follow up article introduces and analyzes a new TGFSR variant having better k-distribution property, and provides an efficient algorithm to obtain the order of equidistribution, together with a tight upper bound on the order.

On the use of reducible polynomials as random number generators

Reducible characteristic polynomials have acceptable figures of merit and can be of extremely high degree, and are strong candidates for reliable random number generation, especially at the bit rates needed in large-scale Monte Carlo simulations.

Uniform random number generation

Practical ways of generating uniform variates for several classes of generators, such as linear congruential, multiple recursive, digital multistep, Tausworthe, lagged-Fibonacci, generalized feedback shift register, matrix, linear Congruential over fields of formal series, and combined generators are examined.

Efficient and portable combined Tausworthe random number generators

This paper proposes three combined Tausworthe random number generators with period length about 1018, whose k-distribution properties are good and which can be implemented in a portable way by applying a battery of statistical tests to these generators.

Random Number Generators Based on Linear Recurrences in \( \mathbb{F}_{2^w } \)

New ways of constructing and implementing random number generators based on linear recurrences in a finite field with 2ω elements, for some integer w are explored.

The k-distribution of generalized feedback shift register pseudorandom numbers

A necessary and sufficient condition is established for the generalized feedback shift register (GFSR) sequence introduced by Lewis and Payne to be k-distributed. Based upon the theorem, a…

Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator

A new algorithm called Mersenne Twister (MT) is proposed for generating uniform pseudorandom numbers, which provides a super astronomical period of 2 and 623-dimensional equidistribution up to 32-bit accuracy, while using a working area of only 624 words.

Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators

This work made extensive computer searches for good parameter sets, with respect to the spectral test, for combined multiple recursive generators of different sizes, and gives a specific code in C that is faster than previous implementations of similar generators.

A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377

A new algorithm is described which requires only 3r/2+O(1) bits of memory and significantly fewer memory references and bit-operations than the standard algorithm for testing reducibility of a trinomial of prime degree r over GF(2).