Random number generation with the recursion X t =X t-3p ⊕X t-3q
Random number generation with the recursion X t =X t-3p ⊕X t-3q
复制标题
使用递归生成随机数 X t =X t-3p ⊕X t-3q
DOI：
10.1016/0377-0427(90)90341-v
复制
发表时间：
1990
影响因子：
2.4
通讯作者：
M. Fushimi
中科院分区：
文献类型：
--
作者：
M. Fushimi
刘易斯和Payne（1973）提出的广义反馈移位寄存器（GFSR）算法使用本原三项式来生成伪随机数序列。我们提出了一个类似的算法，它使用了一个原始多项式与许多非零项，但产生一个数字一样快，原来的GFSR算法。我们的序列保证在更高的维度上是等分布的，并且具有良好的自相关特性。对算法生成的序列进行了大量的统计测试，结果令人满意。
A generalized feedback shift register (GFSR) algorithm proposed by Lewis and Payne (1973) uses a primitive trinomial to generate a sequence of pseudorandom numbers. We propose a similar algorithm which uses a primitive polynomial with many nonzero terms, but generates a number as fast as the original GFSR algorithm. Our sequence is guaranteed to be equidistributed in higher dimensions and to have a good autocorrelation property. Extensive statistical tests have been performed on the sequences generated by our algorithm and the results were quite satisfactory.