Influence of Implementation on the Properties of Pseudorandom Number Generators with a Carry Bit
I. Vattulainen, K. Kankaala, J. Saarinen, T. Ala-Nissila
Abstract
We present results of extensive statistical and bit level tests on three implementations of a pseudorandom number generator algorithm using the lagged Fibonacci method with an occasional addition of an extra bit. First implementation is the RCARRY generator of James, which uses subtraction. The second is a modified version of it, where a suggested error present in the original implementation has been corrected. The third is our modification of RCARRY such that it utilizes addition of the carry bit. Our results show that there are no significant differences between the performance of these three generators.
Create a lesson
Related papers
Confining strings in the reconfined phase of trace deformed three dimensional SU(2) Yang-Mills theory
Claudio Bonati, Michele Caselle, Alessio Negro et al.
Generalizable Equivariant Diffusion Models for Non-Abelian Lattice Gauge Theory: Analytical Foundations and Numerical Scaling Tests
Gert Aarts, Diaa E. Habibi, Andreas Ipp et al.
2+1 flavor light hadron spectrum with PACS10 configurations
K. -I. Ishikawa, N. Ishizuka, Y. Kuramashi et al.
Precision determination of Bc and Bc* meson decay constants from lattice QCD
Navdeep Singh Dhindsa, Debsubhra Chakraborty, Nilmani Mathur
Meson spectroscopy from lattice QCD
Andrew W. Jackura
Generative sampling with physics-informed kernels
Friederike Ihssen, Renzo Kapust, Jan M. Pawlowski