Marsaglia, G. 1976. Random number generation. In: Encyclopedia of Computer Science, eds. A. Ralston and C.L. Meek, 1192-1197. New York: Petrocelli/Charter.

Google Scholar

[7]

Neave, H.R. 1973. On using the Box-Muller transformation with multiplicative congruential pseudorandom number generators. Appl. Slat. 22: 92-97.

Crossref

Google Scholar

[8]

Ripley, B.D. 1987. Stochastic Simulation, Wiley.

Digital Library

Google Scholar

[9]

Tausworthe, R.C. 1965. Random numbers generated by linear recurrence modulo two. Math. Comp. 19: 201-209.

Crossref

Google Scholar

[10]

Tezuka, S. 1987. Walsh-spectral test for GFSR pseudorandom number generators. Comm. A CM. 30: 731-735.

Digital Library

Google Scholar

[11]

Tezuka, S. 1989. Random number generation based on polynomial arithmetic modulo two. Research Report, RT-0017, IBM Tokyo Research Laboratory.

Google Scholar

[12]

Tezuka, S. 1990. Lattice structure of pseudoran dom sequences from shift register generators. In Proceedings of the 1990 Winter Simulation Conference, eds. O. Balci, R.P. Sadowski, and R.E. Nance, 266-269. Institute of Electrical and Electronics Engineers, New Orleans, Louisiana.

Digital Library

Google Scholar

Index Terms

Neave effect also occurs with Tausworthe sequences
1. Computing methodologies
  1. Modeling and simulation
    1. Model development and analysis
      1. Model verification and validation
    2. Simulation evaluation
2. Mathematics of computing
  1. Probability and statistics

Recommendations

The Autocorrelation Structure of Tausworthe Pseudorandom, Number Generators

Given that the autocorrelations for any repeating number sequence are known, this paper gives an algorithm for determining the autocorrelation structure of a new sequence obtained from the original sequence by proper decimation. Therefore, for certain ...
Fast hardware random number generator for the Tausworthe sequence
ANSS '83: Proceedings of the 16th annual symposium on Simulation

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 ...
An Asymptotically Random Tausworthe Sequence

The theoretical limitations on the orders of equidistribution attainable by Tausworthe sequences are derived from first principles and are stated in the form of a criterion to be achieved. A second criterion, extending these limitations to ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

WSC '91: Proceedings of the 23rd conference on Winter simulation

December 1991

1261 pages

ISBN:0780301811

Chairmen:
Barry L. Nelson
The Ohio State Univ., Columbus
,
W. David Kelton
Univ. of Minnesota, Minneapolis
,
Gordon M. Clark
The Ohio State Univ., Columbus

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 December 1991

Check for updates

Qualifiers

Article

Conference

WSC91

Sponsor:

IIE
IEEE-SMCS
ASA
ACM
ORSA
SCS
TIMS
SIGSIM
IEEE-CS
NIST

WSC91: 1991 Winter Simulation Conference

December 8 - 11, 1991

Arizona, Phoenix, USA

Acceptance Rates

Overall Acceptance Rate 3,413 of 5,075 submissions, 67%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
147
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)4

Reflects downloads up to 17 Dec 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

The Autocorrelation Structure of Tausworthe Pseudorandom, Number Generators

Fast hardware random number generator for the Tausworthe sequence

An Asymptotically Random Tausworthe Sequence