Well equidistributed long period linear

Updated on Dec 04, 2023

Edit

Comment

The Well Equidistributed Long-period Linear (WELL) is a pseudorandom number generator developed in 2006 by F. Panneton, P. L'Ecuyer, and M. Matsumoto that is based on linear recurrences modulo 2 over a finite binary field F 2 .

There are a number of versions of the WELL generator proposed: WELL512a, WELL521a, WELL521b, WELL607a, WELL607b, WELL800a, WELL800b, WELL1024a, WELL1024b, WELL19937a, WELL19937b, WELL19937c, WELL21701a, WELL23209a, WELL23209b, WELL44497a, WELL44497b.

Implementations

Implementations of WELL512a, WELL1024a, WELL19937a, WELL19937c, WELL44497a, WELL44497b in C (Free for non-commercial use)

Implementation of WELL512a in Scala

Implementation of WELL1024a in Scala

Implementation of WELL19937a in Scala

Implementation of WELL19937c in Scala

Implementation of WELL44497a in Scala

Implementation of WELL44497b in Scala

Implementations of WELL512, WELL607, WELL800, WELL1024, WELL19937, WELL21701, WELL23209 and WELL44497 in C++

Implementations of WELL512, WELL1024, WELL607 in Java

Implementations of WELL512, WELL1024 in BBC BASIC

Modified "maximally equidistributed" implementations of WELL19937, WELL44497 in C (Free for non-commercial use)

Implementation of WELL512 in C (Public Domain)

References

Well equidistributed long-period linear Wikipedia

(Text) CC BY-SA