Twister Generator of Arbitrary Uniform Sequences
Aleksei F. Deon (N.E. Bauman Moscow State Technical University, Russia)
Yulian A. Menyaev (Winthrop P. Rockefeller Cancer Institute, University of Arkansas for Medical Sciences, USA)
Abstract: Twisting generators for pseudorandom numbers may use a congruential array to simulate stochastic sequences. Typically, the computer program controls the quantity of elements in array to limit the random access memory. This technique may have limitations in situations where the stochastic sequences have an insufficient size for some application tasks, ranging from theoretical mathematics and technic constructions to biological and medical studies. This paper proposes a novel approach to generate complete stochastic sequences which dont need a congruential twisting array. The results of simulation confirm that received random numbers are distributed absolutely uniformly in the set of unique sequences. Moreover, combination of this novel approach with an algorithm of tuning for twisting generation affords the length extension of created sequences without requiring additional computer random access memory.
Keywords: Twister Generator, congruential numbers, pseudorandom number generator, stochastic sequences
Categories: F.2, G.2.1, G.3