Optimum Time for Multiplication on a Digital Computer
H. H. Johnson · The Computer Journal · 1961
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.