The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Fourier Analysis of Uniform Random Number Generators
Journal of the ACM (JACM)
The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number Generators
Journal of the ACM (JACM)
An Asymptotically Random Tausworthe Sequence
Journal of the ACM (JACM)
A comparison of the correlational behavior of random number generators for the IBM 360
Communications of the ACM
Principles of Discrete Event Simulation
Principles of Discrete Event Simulation
Shift Register Sequences
A reconfigurable hardware approach to network simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Performance evaluation of the discrete event simulation computer DESC
ANSS '85 Proceedings of the 18th annual symposium on Simulation
The discrete event simulation computer - DESC
ACM SIGSIM Simulation Digest
Journal of VLSI Signal Processing Systems
| Hi-index | 0.00 |
Many simulation programs require m-dimensional uniformly distributed random numbers. A linear recurrence modulo two generator, based on N-bits and producing L-bit numbers (L ≤ N), according to Tausworthe theory, may yield a sequence of m-tuples uniformly distributed in m &equil; (N/L) dimensions. When using software computing algorithms on a binary computer, for large N (e.g. N &equil; 159), the generation speed is for many purposes too slow. To overcome this disadvantage we present a new concept of a hardware random number generator, to give the Tausworthe sequence with high generation speed independent of the number of bits per word N. For a 32-bit data word computer we have performed statistical tests on three generators, two of them gave good results.