Hostname: page-component-5c6d5d7d68-thh2z Total loading time: 0 Render date: 2024-08-08T05:04:24.985Z Has data issue: false hasContentIssue false
  • English
  • Français

Generating Uniformly Distributed Random Numbers without Floating Point Operations

Published online by Cambridge University Press:  27 July 2009

M. Kolonko
M. Kolonko
Affiliation:
Institut für Mathematik Universität Hildesheim Hildesheim, Germany
Get access Rights & Permissions [Opens in a new window]

Abstract

We present a fast algorithm for random numbers distributed uniformly on (0,1). In contrast to most other generators, it uses no floating point operations. Instead, the internal bit representation of the numbers is generated directly from a random bit source. It can easily be implemented in high-level languages like Modula-2 and shows good empirical behavior.

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 6 , Issue 1 , January 1992 , pp. 139 - 145
Copyright
Copyright © Cambridge University Press 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Devroye, L. (1986). Non-uniform random variate generation. New York: Springer-Verlag.CrossRefGoogle Scholar
Marsaglia, G. (1985). A current view of random number generators. In Billard, L. (ed.), Computer science and statistics: The interface. Amsterdam: Elsevier Science Publishers B.V. (North-Holland), pp. 3–10.Google Scholar
Marsaglia, G. & Tsay, L.-H. (1985). Matrices and the structure of random number sequences. Linear Algebra and Its Applications 67: 147–156.CrossRefGoogle Scholar
Zierler, N. & Brillhart, J. (1968). On primitive trinomials (mode 2). Information and Control 13: 541–554.CrossRefGoogle Scholar
Zierler, N. & Brilihart, J. (1969). On primitive trinomials (mode 2), II. Information and Control 14: 566–569.CrossRefGoogle Scholar