This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
June 1971 (vol. 20 no. 6)
pp. 678-680
Using the formula A ? B=[(A+ B)/2]2-[(A-B)/2]2, the binary multiplication problem is reducible to that of decomposing the square of P 0 ? P1P2... Pkinto a sum of two or three quantities. For the eight-bit case, a study of the multiplication parallelogram suggests p2= R+ S+ T, where Pl and p8 appear only in R, and P2, P7 appear only
Index Terms:
Computer arithmetic, high-speed binary logic, multiplying technique, quarter-square multiplying technique, squaring technique.
Citation:
null Tien Chi Chen, "A Binary Multiplication Scheme Based on Squaring," IEEE Transactions on Computers, vol. 20, no. 6, pp. 678-680, June 1971, doi:10.1109/T-C.1971.223325
Usage of this product signifies your acceptance of the Terms of Use.