A random number generator for 16-bit microcomputers

https://doi.org/10.1016/0305-0548(95)00006-8Get rights and content

Abstract

In a recent article Chang et al. [Computers Ops Res. 21, 199–204 (1994)] investigated the prime modulus M = 32,749 and recommended 227 multipliers selected among 10,912 candidate multipliers. This study examines the multipliers by using the spectral test and points out some weaknesses in the proposed generator. An alternative generator is presented having very long period and satisfactory statistical properties.

References (10)

  • P.-L. Chang et al.

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

    Computers Ops Res.

    (1994)
  • C. Kao

    A random number generator for microcomputers

    J. Opl. Res. Soc.

    (1989)
  • F. Sezgin

    On a random number generator for microcomputers

    J. Opl. Res. Soc.

    (1990)
  • D.E. Knuth
  • N.M. MacLaren

    A limit on the usable length of a pseudorandom sequence

    J. Statist. Comput. Simul.

    (1992)
There are more references available in the full text version of this article.

Dr Sezgin is head of the Computing Center at Atatürk University in Erzurum Turkey and is currently on leave to the Case Center of Syracuse University. He holds the masters degree in statistics from The University of Reading and the doctorate from Ataturk University. His main fields of interest are random numbers, biometrics, correlations and public opinion research.

View full text