Skip to main content
SpringerLink
Log in

Use of discrete automata theory for analyzing methods of multiplication in digital computers using additional shift circuits

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. M. A. Kartsev, Arithmetic of Digital Machines [in Russian], Nauka, Moscow (1969).

    Google Scholar 

  2. O. L. Mac-Corley, “High-speed arithmetic in binary computers,” IRE Proceedings,49, No. 1 (1961).

  3. A. M. Mokrinskii and N. N. Trofimov, “Two fast-multiplication algorithms for computers,” Avtomat. i Telemekhan., No. 1 (1969).

  4. B. M. Kagan and V. N. Stepanov, “Use of theory of Markov chains for analyzing asynchronous methods of multiplication in digital computers,” Izv. Akad. Nauk SSSR, Tekhnicheskaya Kibernetika, No. 1 (1970).

  5. M. Lehman, “Short-cut multiplication and division in automatic binary digital computers,” IEE proceedings,105, Part B, No. 23 (1958).

  6. E. N. Vavilov and L. P. Lobanov, “A method of specification of automata,” Izv. Akad. Nauk SSSR, Tekhnicheskaya Kibernetika, No. 3 (1966).

Download references

Authors
  1. E. N. Vavilov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. G. Chobanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 66–70, May–June, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vavilov, E.N., Chobanov, S.G. Use of discrete automata theory for analyzing methods of multiplication in digital computers using additional shift circuits. Cybern Syst Anal 8, 422–426 (1972). https://doi.org/10.1007/BF01068996

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation