Skip Navigation

The Computer Journal 1961 3(4):256-261; doi:10.1093/comjnl/3.4.256
© 1961 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Johnson, H. H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Optimum Time for Multiplication on a Digital Computer

H. H. Johnson

Institute of Technology, Bradford, UK

Methods of multiplication used on serial binary computers are discussed with reference to the optimum time required on a machine with a cyclic main store. From this point of view the methods are shown to be of four main types and the time to be allowed for multiplication in optimum programming is calculated in a number of cases. The possible time-saving of reversing the multiplier and multiplicand is also considered.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.