Some good multipliers for random number generator for 16-bit microcomputers

Chang Pao-long, Hwang Shiuh-nan, Kao Chiang

研究成果: Article

3 引文 斯高帕斯(Scopus)

摘要

In searching for statistically sound multipliers for the prime modulus multiplicative congruential random number generator for 16-bit microcomputers, an exhaustive analysis is conducted over the 10,912 primitive roots of the modulus 215 - 19 = 32,749. The result shows that there are only 227 good multipliers among the 10,912 candidate multipliers. Here a multiplier is said to be good if its corresponding generator has good statistical properties and computational efficiency.

原文English
頁(從 - 到)199-204
頁數6
期刊Computers and Operations Research
21
發行號2
DOIs
出版狀態Published - 1994 二月

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

指紋 深入研究「Some good multipliers for random number generator for 16-bit microcomputers」主題。共同形成了獨特的指紋。

  • 引用此