An exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers

نویسنده

  • Hui-Chin Tang
چکیده

This paper presents results of an exhaustive computer search for the maximum spectral value in full period two-term kth-order multiple recursive generators (MRGs) with efficient multipliers. For orders k = 2, 3, . . . , 7, we provide a table of kth-order MRGs with largest spectral values. These MRGs not only have the best spectral values found so far but also can be implemented efficiently by applying the approximate factoring method. © 2005 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large-Order Multiple Recursive Generators with Modulus 231 - 1

T performance of a maximum-period multiple recursive generator (MRG) depends on the choices of the recurrence order k, the prime modulus p, and the multipliers used. For a maximum-period MRG, a largeorder k not only means a large period length (i.e., p − 1) but, more importantly, also guarantees the equidistribution property in high dimensions (i.e., up to k dimensions), a desirable feature for...

متن کامل

Scalable parallel multiple recursive generators of large order

To speed up the process of performing a large statistical simulation study, it is natural and common to divide the large-scale simulation task into several relatively independent subtasks in a way that these sub-tasks can be handled by individual processors in parallel. To obtain a good overall simulation result by synthesizing results from these sub-tasks, it is crucial that good parallel rand...

متن کامل

Fast combined multiple recursive generators with multipliers of the form a = ±2q ±2r

We study a class of combined multiple recursive random number generators constructed in a way that each component runs fast and is easy to implement, while the combination enjoys excellent structural properties as measured by the spectral test. Each component is a linear recurrence of order k > 1, modulo a large prime number, and the coefficients are either 0 or are of the form a = ±2q or a = ±...

متن کامل

Vlsi Design of Efficient Architecture in Recursive Pseudo-exhaustive Two-pattern Generation

The aim of built in self-test is to make the machine to test by itself. The best method among the built in self-test is pseudo exhaustive two pattern generation produces the output according to the input given with 16bit generator. The main drawback that occurs in this test pattern generation is maximum delay. It occurs in the carry generator module. In this paper, the method proposed with recu...

متن کامل

Design of Cryptographically Strong Generator By Transforming Linearly Generated Sequences

Random numbers have been used extensively in many simulation applications like Monte Carlo Integration or computer modeling. But recently security applications have increased the need for strong (secure) random number generation like automatic password generation, encryption algorithms, on-line gambling etc. Thus random number generation has become a challenging and an interesting task. Most cl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006