This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
December 1974 (vol. 23 no. 12)
pp. 1327
P.E. Blankenship, M.I.T. Lincoln Laboratory
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.
Citation:
P.E. Blankenship, "Comments on "A Two's Complement Parallel Array Multiplication Algorithm"," IEEE Transactions on Computers, vol. 23, no. 12, pp. 1327, Dec. 1974, doi:10.1109/T-C.1974.223862
Usage of this product signifies your acceptance of the Terms of Use.