ACM Home Page
Please provide us with feedback. Feedback
On the discrepancy of GFSR pseudorandom numbers
Full text PdfPdf (611 KB)
Source Journal of the ACM (JACM) archive
Volume 34 ,  Issue 4  (October 1987) table of contents
Pages: 939 - 949  
Year of Publication: 1987
ISSN:0004-5411
Author
Shu Tezuka  IBM Tokyo Research Lab, Tokyo, Japan
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 40,   Citation Count: 4
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/31846.31848
What is a DOI?

ABSTRACT

A new summation formula based on the orthogonal property of Walsh functions is devised. Using this formula, the k-dimensional discrepancy of the generalized feedback shift register (GFSR) pseudorandom numbers is derived. The relation between the discrepancy and k-distribution of GFSR sequences is also obtained. Finally the definition of optimal GPSR pseudorandom number generators is introduced.


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
BEAUCHAMP, K.G. Walsh Functions and Their Applications. Academic Press, London, 1975.
 
2
BOROSH, I., AND NIEDERREITER, H. Optimal multipliers for pseudorandom number generation by the linear congruential method. BIT 23 (1983), 65-74.
3
 
4
KNtrrH, D. E. The Art of Computer Programming, vol. 2: Seminumerical Algorithms, 2nd ed. Addison-Wesley, Reading, Mass., 1981.
 
5
KuNz, H. O., AND RAMM-ARNFr, J. Walsh matrices. Arch. Elektron. Ubertragungstech. (Electron. Commun.) 32 (1978), 56-58.
6
 
7
MARSAGLIA, G. Random number generator. In Encyclopedia of Computer Science, A. Ralston and C. L. Meek, Eds. Petrocelli/Charter, New York, 1976.
 
8
NIFDERREITER, H. Pseudorandom numbers and optimal coefficients. Adv. Math. 26 (1977), 99-181.
 
9
NIEDERREITER, H. Quasi-Monte Carlo methods and pseudorandom numbers. Bull. Amer. Math. Soc. 84 (1978), 957-1041.
 
10
NIEDFRRErrER, H. Applications des corps finis aux nombres pesudoaleatoires. Sere. Theorie des Nombres 1982-83, Exp. 38. Univ. de Bordeaux 1, Talence, France, 1983.
 
11
NIEDFRREIT~R, H. The performance of K-step pseudorandom number generators under the uniformity test. SIAM J. Sci. Statist. Comput. 5 (1984), 798-810.
 
12
TAUSWORTHE, R. C. Random numbers generated by linear recurrence modulo two. Math. Comput. 19 (1965), 201-209.
13



REVIEW

"Taghi J. Mirsepassi : Reviewer"

.abstract A new summation formula based on the orthogonal property of Walsh functions is devised. Using this formula, the k-dimensional discrepancy of the generalized feedback shift register (GFSR) pseudorandom numbers is derived. The  more...


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