• DocumentCode
    1112088
  • Title

    A Two´s Complement Parallel Array Multiplication Algorithm

  • Author

    Baugh, Charles R. ; Wooley, Bruce A.

  • Author_Institution
    Bell Laboratories
  • Issue
    12
  • fYear
    1973
  • Firstpage
    1045
  • Lastpage
    1047
  • Abstract
    An algorithm for high-speed, two´s complement, m-bit by n-bit parallel array multiplication is described. The two´s complement multiplication is converted to an equivalent parallel array addition problem in which each partial product bit is the AND of a multiplier bit and a multiplicand bit, and the signs of all the partial product bits are positive.
  • Keywords
    Array multiplier, binary multiplication, high-performance multiplication, parallel multiplier, two´s complement multiplication.; Virtual manufacturing; Array multiplier, binary multiplication, high-performance multiplication, parallel multiplier, two´s complement multiplication.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

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