• DocumentCode
    1116843
  • Title

    A Proof of the Modified Booth´s Algorithm for Multiplication

  • Author

    Rubinfield, Louis P.

  • Author_Institution
    Computers Systems Laboratory, Washington University
  • Issue
    10
  • fYear
    1975
  • Firstpage
    1014
  • Lastpage
    1015
  • Abstract
    A simplified proof of a modification of Booth´s multiplication algorithm by MacSorley to a form which examines three multiplier bits at a time is presented. In comparison with the original Booth´s algorithm, which examines two bits at a time, the modified algorithm requires half the nutmber of iterations at the cost of somewhat increased complexity for each iteration.
  • Keywords
    Modified Booth´s algorithm, multiplicand, multiplier, partial product.; Clocks; Costs; Decoding; Modified Booth´s algorithm, multiplicand, multiplier, partial product.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1975.224114
  • Filename
    1672707
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1116843