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

摘要

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.