Skip to main content
Download PDF
- Main
Design, Search and Implementation of High-dimension, Efficient, Long-cycle and Portable Uniform Random Variate Generator
Abstract
We propose a system of multiple recursive generators of modulus p and order k where all nonzero coefficients of the recurrence are equal. The advantage of this property is that a single multipli- cation is needed to compute the recurrence, so the generator would run faster than the general case. For p = 231 − 1, the most popular modulus used, we provide tables of specific parameter values yielding maximum period for recurrence of order k = 102 and 120. For p = 231 55719 and k = 1511, we have found generators with a period length approximately 1014100.5 .
Main Content
For improved accessibility of PDF content, download the file to your device.
Enter the password to open this PDF file:
File name:
-
File size:
-
Title:
-
Author:
-
Subject:
-
Keywords:
-
Creation Date:
-
Modification Date:
-
Creator:
-
PDF Producer:
-
PDF Version:
-
Page Count:
-
Page Size:
-
Fast Web View:
-
Preparing document for printing…
0%