Skip to main content
Log in

A random-number generator with a variable distribution law

  • Published:
Cybernetics Aims and scope

Conclusions

It was shown above that with moderate requirements towards the accuracy of reproduction (by the generator) of a given distribution law, it is possible to considerably reduce the keyboard length compared to the estimates presented in [1]. Together with the keyboard length we can also considerably reduce the required number of logical elements. Thus if we obtain mk=0 for the k-th digit, we can replace the corresponding BE by a random-sign generator. In this case the need for a generator γ (V)k−1 disappears altogether.

At the same time the above method of generation of random numbers makes it possible to increase (on the basis of very tentative calculations) the generator speed to 500–600 thousand numbers per second. The operation can be organized in such a way that at the instant at which the k-th BE generates the k-th digit of a random number, the (k-1)-th BE will generate the (k-1)-th digit of the next number. By such a “conveyer” method it is possible to simultaneously obtain as many random numbers as there are basic elements in the generator. In the future, taking into account the possibility of designing a generator on the basis of extra-high-speed homogeneous computational elements, it should be possible to increase practically as much as desired the speed of generation of random numbers.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Literature Cited

  1. R. G. Bukharaev, “Controlled random number generators” Uch. Zap. Kazan. Univers.123, 6, Kazan' (1963).

    Google Scholar 

  2. M. K. Chirkov, “A method of probabilistic logic,” in: Computing Techniques and Cybernetic Problems, No. 8, Leningrad (1971).

  3. É. Borel, R. Delteil, and R. Huron, Probabilities and Certainty, Walker (1963).

  4. J. Hadley Nonlinear and Dynamic Programming, Addison-Wesley, Reading (1964).

    Google Scholar 

  5. É. V. Evreinov, “Computing systems and environments,” Avtomat, i Vych. Tekh. No. 1, Moscow (1971).

Download references

Authors

Additional information

Translated from Kibernetika, No. 1, pp. 115–121, January–February, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bershtein, M.S., Romankevich, A.M. A random-number generator with a variable distribution law. Cybern Syst Anal 9, 137–144 (1973). https://doi.org/10.1007/BF01068676

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01068676

Keywords

Navigation