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-1328
D. Kroft, Canadian Development Division, Control Data Canada Ltd.
This correspondence presents a simpler proof for Baugh and Wooley's two's complement parallel array multiplication algorithm, as demonstrated in a recent paper.1 The above algorithm converts a two's complement multiplication to an equivalent parallel array addition problem in which all partial product bits are positive.
Index Terms:
Array multiplication, binary multiplication, parallel multiplication, two's complement multiplication.
Citation:
D. Kroft, "Comments on "A Two's Complement Parallel Array Multiplication Algorithm"," IEEE Transactions on Computers, vol. 23, no. 12, pp. 1327-1328, Dec. 1974, doi:10.1109/T-C.1974.223863
Usage of this product signifies your acceptance of the Terms of Use.