TY - JOUR
T1 - Some good multipliers for random number generator for 16-bit microcomputers
AU - Pao-long, Chang
AU - Shiuh-nan, Hwang
AU - Chiang, Kao
PY - 1994/2
Y1 - 1994/2
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0028377981&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0028377981&partnerID=8YFLogxK
U2 - 10.1016/0305-0548(94)90052-3
DO - 10.1016/0305-0548(94)90052-3
M3 - Article
AN - SCOPUS:0028377981
SN - 0305-0548
VL - 21
SP - 199
EP - 204
JO - Computers and Operations Research
JF - Computers and Operations Research
IS - 2
ER -