Interval algorithm for random number generation

The problem of generating a random number with an arbitrary probability distribution by using a general biased M-coin is studied. An efficient and very simple algorithm based on the successive refinement of partitions of the unit interval (0, 1), which we call the interval algorithm, is proposed. A...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory Jg. 43; H. 2; S. 599 - 611
Hauptverfasser:	Te Sun Han, Hoshi, M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.03.1997 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Arithmetic Entropy Information processing Markov processes Numbers Partitioning algorithms Probability distribution Random number generation Stochastic processes Sun Tellurium Upper bound
ISSN:	0018-9448, 1557-9654
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!