A Xorshift is a type of pseudorandom number generator (PRNG) that utilizes shift and XOR operations to generate a sequence of pseudorandom numbers. Introduced by George Marsaglia in 2003, the Xorshift is renowned for its speed and simplicity of implementation in both hardware and software platforms.
The Xorshift algorithm employs a state register that, in the case of an 8-bit Xorshift, consists of an 8-bit integer. This register maintains the current state of the PRNG, which is updated with each iteration to produce the subsequent pseudorandom number.
At each step, the current state is altered using a series of XOR and shift operations. For instance, an 8-bit Xorshift might proceed as follows:
x = x ⊕ (x << a)
x = x ⊕ (x >> b)
x = x ⊕ (x << c)
Here, x
denotes the current state, while <<
and >>
signify left and right shifts, respectively. The constants a
, b
, and c
determine the magnitude of these shifts.
The period of a Xorshift depends on both the number of bits in the state register and the choice of shift parameters a
, b
, and c
. For an 8-bit register, the maximum achievable period is 2^8 - 1 = 255
, assuming the parameters are selected wisely to prevent short cycling.
To test this random number generator you must place an 8-bit seed as input (ui_in) and after 2 cycles of latency you will obtain a random number at each clock cycle at the output (uo_out).
For more information about rtl: tt_um_jorga20j_prng.md
# | Input | Output | Bidirectional |
---|---|---|---|
0 | Seed bit 0 | Pseudo-Random number bit 0 | |
1 | Seed bit 1 | Pseudo-Random number bit 1 | |
2 | Seed bit 2 | Pseudo-Random number bit 2 | |
3 | Seed bit 3 | Pseudo-Random number bit 3 | |
4 | Seed bit 4 | Pseudo-Random number bit 4 | |
5 | Seed bit 5 | Pseudo-Random number bit 5 | |
6 | Seed bit 6 | Pseudo-Random number bit 6 | |
7 | Seed bit 7 | Pseudo-Random number bit 7 |