Random number generation with primitive pentanomials

Authors:
Pei-Chi Wu
Affiliations:
National Penghu Institute of Technology, Penghu, Taiwan, R.O.C.
Venue:
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Year:
2001

Citing 10
Cited 1

Random number generations generators on Vector supercomputers and other advanced architectures

SIAM Review
Twisted GFSR generators

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Twisted GFSR generators II

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Maximally equidistributed combined Tausworthe generators

Mathematics of Computation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
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
Tables of maximally equidistributed combined LFSR generators

Mathematics of Computation
Generalized Feedback Shift Register Pseudorandom Number Algorithm

Journal of the ACM (JACM)
Beware of linear congruential generators with multipliers of the form a = ±2q ±2r

ACM Transactions on Mathematical Software (TOMS)
The k-distribution of generalized feedback shift register pseudorandom numbers

Communications of the ACM

Pseudorandom number generator using optimal normal basis

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents generalized feedback shift register (GFSR) generators with primitive polynomials xp + xp-1 + xq + xq-1 + 1. The recurrence of these generators can be efficiently computed. We adopt Fushimi's initialization scheme, which guarantees the k-distribution property. Statistical and timing results are presented.