flâneur

Permuted congruential generator - Wikipedia

en.wikipedia.org · 2,023 words · saved by 1 readers

A permuted congruential generator (PCG) is a pseudorandom number generation algorithm developed in 2014 by Dr. M.E. O'Neill which applies an output permutation function to improve the statistical properties of a modulo-2n linear congruential generator (LCG). It achieves excellent statistical performance[1][2][3][4] with small and fast code, and small state size.[5] LCGs with a power-of-2 modulus are simple, efficient, and have uniformly distributed binary outputs, but suffer from a well-known problem of short periods in the low-order bits.[5]: 31–34 A PCG addresses this by adding an output transformation between the LCG state and the PCG output. This adds two elements to the LCG: The variable rotation ensures that all output bits depend on the most-significant bit of state, so all output bits have full period. The PCG family includes a number of variants. The core LCG is defined for widths from 8 to 128 bits[citation needed], although only 64 and 128 bits are recommended for practical

Permuted congruential generator - Wikipedia Jump to content From Wikipedia, the free encyclopedia Type of pseudorandom number generation algorithm A permuted congruential generator ( PCG ) is a pseudorandom number generation algorithm developed in 2014 by Dr. M.E. O'Neill which applies an output permutation function to improve the statistical properties of a modulo-2 n linear congruential generator (LCG). It achieves excellent statistical performance [ 1 ] [ 2 ] [ 3 ] [ 4 ] with small and fast code, and small state size. [ 5 ] LCGs with a power-of-2 modulus are simple, efficient, and have unif

related reading