ACM Home Page
Please provide us with feedback. Feedback
Twisted GFSR generators II
Full text PdfPdf (774 KB)
Source ACM Transactions on Modeling and Computer Simulation (TOMACS) archive
Volume 4 ,  Issue 3  (July 1994) table of contents
Pages: 254 - 266  
Year of Publication: 1994
ISSN:1049-3301
Authors
Makoto Matsumoto  Kyoto Univ., Kyoto, Japan
Yoshiharu Kurita  National Research Lab of Metrology, Tsukuba, Japan
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 70,   Citation Count: 22
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/189443.189445
What is a DOI?

ABSTRACT

The twisted GFSR generators proposed in a previous article have a defect in k-distribution for k larger than the order of recurrence. In this follow up article, we introduce and analyze a new TGFSR variant having better k-distribution property. We provide an efficient algorithm to obtain the order of equidistribution, together with a tight upper bound on the order. We discuss a method to search for generators attaining this bound, and we list some of these such generators. The upper bound turns out to be (sometimes far) less than the maximum order of equidistribution for a generator of that period length, but far more than that for a GFSR with a working are of the same size.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
FREDRICSSON, S.A. 1975. Pseudo-randomness properties of binary shift register sequences. IEEE Trans. Inf. Theory IT-21, 115-120
 
2
3
 
4
5
 
6
L'ECU~ER, P. 1994. Uniform random number generation. An. Oper. Res. To be published.
 
7
LINDHOLM, J. H. 1968. An analysis of the pseudo-randomness properties of subsequences of long m-sequences. IEEE Trans. lnf. Theory IT-14 (July), 569 576.
8
9

CITED BY  22
 
 
 
 
 
 


REVIEW

"Taghi J. Mirsepassi : Reviewer"

The authors present an algorithm for generating pseudorandom numbers. The method developed here is an extension of their earlier work [1]. After some preliminary definitions, the algorithm is developed by proving two th  more...

Collaborative Colleagues:
Makoto Matsumoto: colleagues
Yoshiharu Kurita: colleagues

Peer to Peer - Readers of this Article have also read: