• DocumentCode
    1114291
  • Title

    Comments on "A Two\´s Complement Parallel Array Multiplication Algorithm"

  • Author

    Blankenship, P.E.

  • Issue
    12
  • fYear
    1974
  • Firstpage
    1327
  • Lastpage
    1327
  • Abstract
    The two´s complement multiplication algorithm discussed by Baugh and Wooley1 is indeed a viable one, and we have used it several times in the past to great advantage in applications where modestly high performance signed multiplies were required, but the design was constrained to commercially available, standard components. This approach to sign compensation, which was first described to me in 1969 by C. M. Rader, does give rise to a uniform partial product array which can be efficiently summed by any of several techniques.
  • Keywords
    Algorithm design and analysis; Military computing; Optimal control; Parallel processing; Programmable logic arrays; Tree data structures; Wire;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1974.223862
  • Filename
    1672455