Introduction to finite fields and their applications
Introduction to finite fields and their applications
Communications of the ACM - Special issue on simulation
Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
Testing random number generators
WSC '92 Proceedings of the 24th conference on Winter simulation
Analysis of add-with-carry and subtract-with-borrow generators
WSC '92 Proceedings of the 24th conference on Winter simulation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Lattice structure of pseudorandom sequences from shift-register generators
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Linear recurrences with carry as uniform random number generators
WSC '95 Proceedings of the 27th conference on Winter simulation
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Bad subsequences of well-known linear congruential pseudorandom number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Sum-discrepancy test on pseudorandom number generators
Mathematics and Computers in Simulation - Special issue: 3rd IMACS seminar on Monte Carlo methods - MCM 2001
Efficient multiply-with-carry random number generators with maximal period
ACM Transactions on Modeling and Computer Simulation (TOMACS)
TestU01: A C library for empirical testing of random number generators
ACM Transactions on Mathematical Software (TOMS)
Common defects in initialization of pseudorandom number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Narrowband interference suppression for MIMO OFDM systems using adaptive filter banks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Optimization of the Monte Carlo code for modeling of photon migration in tissue
Computer Methods and Programs in Biomedicine
Fast and reliable random number generators for scientific computing
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
| Hi-index | 0.03 |
Marsaglia and Zaman recently proposed new classes of random number generators, called add-with-carry(AWC) and subtract-with-borrow(SWB), which are capable of quickly generating very long-period (pseudo)-random number sequences using very little memory. We show that these sequences are essentially equivalent to linear congruential sequences with very large prime moduli. So, the AWC/SWB generators can be viewed as efficient ways of implementing such large linear congruential generators. As a consequence, the theoretical properties of such generators can be studied in the same way as for linear congruential generators, namely, via the spectral and lattice tests. We also show how the equivalence can be exploited to implement efficient jumping-ahead facilities for the AWC and SWB sequences. Our numerical examples illustrate the fact that AWC/SWB generators have extremely bad lattice structure in high dimensions.