J. P. R. Tootill
Abstract
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 multidimensional uniformity, is also defined. A sequence possessing both properties is said to be asymptotically random as no other sequence of the same period could be more random in these respects.
An algorithm is presented which, for any Tausworthe sequence based on a primitive trinomial over GF(2), establishes how closely or otherwise the conditions necessary for the criteria are achieved. Given that the necessary conditions are achieved, the conditions sufficient for the first criterion are derived from Galois theory and always apply. For the second criterion, however, the period must be prime.
An asymptotically random 23-bit number sequence of astronomic period, 2607 - 1, is presented. An initialization program is required to provide 607 starting values, after which the sequence can be generated with a three-term recurrence of the Fibonacci type. In addition to possessing the theoretically demonstrable randomness properties associated with Tausworthe sequences, the sequence possesses equidistribution and multidimensional uniformity properties vastly in excess of anything that has yet been shown for conventional congruentially generated sequences. It is shown that, for samples of a size it is practicable to generate, there can exist no purely empirical test of the sequence as it stands capable of distinguishing between it and an ∞-distributed sequence. Bounds for local nonrandomness in respect of runs above (below) the mean and runs of equal numbers are established theoretically.
The claimed randomness properties do not necessarily extend to subsequences, though it is not yet known which particular subsequences are at fault.
Accordingly, the sequence is at present suggested only for simulations with no fixed dimensionality requirements.
- 1 TAUSWORTHE, R. C Random numbers generated by hnear recurrence modulo two Math. Comput. 19, 90 (1965), 201-209Google Scholar
- 2 TOOTILL, j. P. R, ROBINSON, W. D., AND ADAMS, A. G The runs up-and-down performance of Tausworthe pseudo-random number generators J ACM 18, 3 (July 1971), 381-399. Google Scholar
- 3 CovEYou, R R, AND MAcPHERSON, R D Fourmr analysm of umform random number generators J ACM 14, 1 (Jan 1967), 100-119 Google Scholar
- 4 KNVTH, D EThe Art of Computer Programm~g, Vol 2 Addison-Wesley, Reading, Mass , 1969 Google Scholar
- 5 GOLOMB, S. W Sh~ft Register Sequences Holden-Day, San Francisco, 1967, pp 44-45 Google Scholar
- 6 ZIERLER, N.Pmmltlve trlnomlals whose degree is a Mersenne exponent Inform. Contr. 15, 1 (1969), 67-69Google Scholar
- 7 CHAITIN, G. J On the length of programs for computing finite binary sequences. J. ACM 18, 4 (Oct 1966), 547-569. Google Scholar
- 8 MARTIN-LOF, P The defimtlon of random sequences Inform. Contr 9, 6 (1966), 602-619.Google Scholar
- 9 MARTIN-LOF, P. Algomthms and randomness. Rev Internat Statzst instlt 37, 3 (1969), 265-272Google Scholar
Index Terms
- An Asymptotically Random Tausworthe Sequence
Recommendations
Fast hardware random number generator for the Tausworthe sequence
ANSS '83: Proceedings of the 16th annual symposium on SimulationMany 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 ...
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 ...
Zero-Correlation Zone Sequence Set Constructed from a Perfect Sequence and a Complementary Sequence Pair
The present paper introduces the construction of a class of sequence sets with zero-correlation zones called zero-correlation zone sequence sets. The proposed zero-correlation zone sequence set can be generated from an arbitrary perfect sequence and an ...
Comments