![]() The IBM subroutine RANDU LCG fails in this test for 3 dimensions and above.Ī linear congruential generator (LCG) is an algorithm that yields a sequence of pseudo–randomized numbers calculated with a discontinuous piecewise linear equation. As this test is devised to study the lattice structures of LCGs, it can not be applied to other families of PRNGs.Īccording to Donald Knuth, this is by far the most powerful test known, because it can fail LCGs which pass most statistical tests. The spectral test compares the distance between these planes the further apart they are, the worse the generator is. LCGs have a property that when plotted in 2 or more dimensions, lines or hyperplanes will form, on which all possible outputs can be found. The spectral test is a statistical test for the quality of a class of pseudorandom number generators (PRNGs), the linear congruential generators (LCGs). when n=3, the points lie on parallel planes. One major problem of LGC is that, when consecutive terms are taken as n-tuple and plotted, they form n-dimentional planes. this is graph of “Spectral test” on random number generator algorithm called Linear Congruential Generator (LCG). Spectral test on Linear Congruential Generator ![]() ![]() ![]() , where A C M are carefully chosen numbers. One old, popular pseudo random number generator algorithm is called Linear congruential generator.
0 Comments
Leave a Reply. |