|
Xorshift random number generators are a class of pseudorandom number generators that was discovered by George Marsaglia.〔 They generate the next number in their sequence by repeatedly taking the exclusive or of a number with a bit shifted version of itself. This makes them extremely fast on modern computer architectures. They are a subclass of linear feedback shift registers, but their simple implementation typically makes them faster and use less space.〔 However, the parameters have to be chosen very carefully in order to achieve a long period.〔 Xorshift generators are among the fastest non-cryptographically-secure random number generators, requiring very small code and state. Although they do not pass every statistical test without further refinement, this weakness is well-known and easily amended (as pointed out by Marsaglia in the original paper) by combining them with a non-linear function, resulting e.g. in a xorshift+ or xorshift * generator. A naive C implementation of a xorshift+ generator that passes all tests from the BigCrush suite (with an order of magnitude fewer failures than Mersenne Twister or WELL) typically takes fewer than 10 clock cycles on x86 to generate a random number, thanks to instruction pipelining.〔 Because plain xorshift generators (without a non-linear step) fail a few statistical tests, they have been accused of being unreliable.〔 ==Example implementation== A C/C++ version〔In C/C++, the caret ( ^) represents the bitwise XOR, and " << " the bit shift.〕 of one xorshift algorithm〔 is:#include / * These state variables must be initialized so that they are not all zero. */ uint32_t x, y, z, w; uint32_t xorshift128(void) This algorithm has a maximal period of 〔 and passes the diehard tests. However, it fails the MatrixRank and LinearComp tests of the BigCrush test suite from the TestU01 framework. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Xorshift」の詳細全文を読む スポンサード リンク
|