Difference between revisions of "Pseudo random number generators"
From ScienceZero
Line 1: | Line 1: | ||
Here is a single instruction one for the [[ARM]]: | Here is a single instruction one for the [[ARM]]: | ||
− | + | :RSB R0,R0,R0,ROR #21 | |
The analysis of 40 000 000 bytes worth of the least significant byte: | The analysis of 40 000 000 bytes worth of the least significant byte: | ||
Line 11: | Line 11: | ||
+ | Some [[linear feedback shift registers]] are excellent pseudo random number generators. | ||
[[Category:Computing]] | [[Category:Computing]] |
Revision as of 14:59, 1 February 2007
Here is a single instruction one for the ARM:
- RSB R0,R0,R0,ROR #21
The analysis of 40 000 000 bytes worth of the least significant byte:
- Entropy = 7.999 985 bits per byte.
- Optimum compression would reduce the size of this 40 000 000 byte file by 0 percent.
- Chi square distribution for 40 000 000 samples is 810.80, and randomly would exceed this value 0.01 percent of the times.
- Arithmetic mean value of data bytes is 127.4731 (127.5 = random).
- Monte Carlo value for Pi is 3.143 189 714 (error 0.05 percent).
- Serial correlation coefficient is -0.000 131 (totally uncorrelated = 0.0).
Some linear feedback shift registers are excellent pseudo random number generators.