Some long-period random number generators using shifts and xors

Details Some long-period random number generators using shifts and xors Some long-period random number generators using shifts and xors

2010-04-19

arxiv.org/abs/1004.3115v1

ANZIAM Journal 48 (CTAC2006), C188-C202, 2007

Computer Science

Data Structures and Algorithms

11 pages

Scientific paper

Marsaglia recently introduced a class of xorshift random number generators (RNGs) with periods 2n-1 for n = 32, 64, etc. Here we give a generalisation of Marsaglia's xorshift generators in order to obtain fast and high-quality RNGs with extremely long periods. RNGs based on primitive trinomials may be unsatisfactory because a trinomial has very small weight. In contrast, our generators can be chosen so that their minimal polynomials have large weight (number of nonzero terms). A computer search using Magma has found good generators for n a power of two up to 4096. These have been implemented in a free software package xorgens.

Affiliated with

Also associated with

No associations

Rating

Some long-period random number generators using shifts and xors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some long-period random number generators using shifts and xors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some long-period random number generators using shifts and xors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-59356