Examples of this family include xorshift generators and the Mersenne twister. The latter provides a very long period (219937−1) and variate uniformity, but it fails some statistical tests. Lagged Fibonacci generators also fall into this category; although they use arithmetic addition, their period is ensured by an LFSR among the least-significant bits.
examples of this family include xorshift generators and the mersenne twister the latter provides a very long period (219937−1) and variate uniformity but it fails some statistical tests lagged fibonacci generators also fall into this category; although they use arithmetic addition their period is ensured by an lfsr among the least-significant bits