Multiplication is usually regarded as the second most important arithmetic function. However, statistics suggest that in some large scientific programs it occurs as frequently as addition and subtraction combined. As in the previous chapter, this chapter will discuss the procedures involved in multiplication of two binary ‘bit patterns’, and will not discuss the problems of handling signed numbers. Signed multiplication will be described in chapter 4 in the discussion of the representation of negative numbers.


Digital Computer Partial Product Arithmetic Unit Carry Save Adder Serial Adder 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Booth, A. D., ‘A Signed Binary Multiplication Technique’, Q. Jl Mech. appl. Math., 4 (1951) 236–40.MathSciNetCrossRefzbMATHGoogle Scholar
  2. Dadda, L., ‘Some Schemes for Parallel Multipliers’, Alta Freq., 34 (1965) 349–56.Google Scholar
  3. Dean, K. J., ‘Design for a Full Multiplier’, Proc. I.E.E., 115 (1969) 1592–4.CrossRefGoogle Scholar
  4. This design, like many others on similar lines, is not fast, and is very expensive. de Mori, R., ‘Suggestion for an IC Fast Parallel Multiplier’, Electron. Lett, 5 (1969) 50–1. Yet another design which is not fast, and very expensive.CrossRefGoogle Scholar
  5. Gosling, J. B., ‘Design of Large High Speed Binary Multiplier Units’, Proc. I.E.E., 118 (1971) 499–505. First description, as such, of the twin-beat multiplier (termed serial—parallel here). Useful assessment of cost effectiveness of multipliers at that time. Relative figures are still relevant.CrossRefGoogle Scholar
  6. Gosling, J. B., Kinniment, D. J., and Edwards, D. B. G., ‘Uncommitted Logic Array Provides Cost Effective Multiplication even for Long Words’, Comput. dig. Tech., 2 (1979) 113–20.CrossRefGoogle Scholar
  7. Guild, H. H., ‘Fully Iterative Fast Array for Binary Multiplication and Addition’, Electron. Lett, 5 (1969) 263. Another design which is not fast, and very expensive.CrossRefGoogle Scholar
  8. Habibi, A., ‘Fast Multipliers’, I.E.E.E. Trans. Comput, 19 (1970) 153–7.CrossRefzbMATHGoogle Scholar
  9. Kilburn, T., Edwards, D. B. G., and Thomas, G. E., ‘The Manchester Mk II Digital Computing Machine’, Proc. I.E.E., 107B Suppl. 2 (1956) 247–68. An early paper describing a carry-save-adder multiplier, though not by that name.Google Scholar
  10. Thornton, J. E., Design of a Computer: CDC 6600 (Scott Foresman, Glenview, Ill, 1970).Google Scholar
  11. Wallace, C. S., ‘A Suggestion for a Fast Multiplier’, I.E.E.E. Trans. electronic Comput, 13 (1964) 14–17. A simultaneous multiplier with carry-save adders.CrossRefzbMATHGoogle Scholar

Copyright information

© John B. Gosling 1980

Authors and Affiliations

  • John B. Gosling
    • 1
  1. 1.Department of Computer ScienceUniversity of ManchesterUK

Personalised recommendations