The Community for Technology Leaders
Green Image
Issue No. 06 - June (1971 vol. 20)
ISSN: 0018-9340
pp: 678-680
Using the formula A ? B=[(A+ B)/2]<sup>2</sup>-[(A-B)/2]<sup>2</sup>, the binary multiplication problem is reducible to that of decomposing the square of P 0 ? P<inf>1</inf>P<sup>2</sup>... P<inf>k</inf>into a sum of two or three quantities. For the eight-bit case, a study of the multiplication parallelogram suggests p<sup>2</sup>= R+ S+ T, where Pl and p8 appear only in R, and P2, P7 appear only
Computer arithmetic, high-speed binary logic, multiplying technique, quarter-square multiplying technique, squaring technique.
null Tien Chi Chen, "A Binary Multiplication Scheme Based on Squaring", IEEE Transactions on Computers, vol. 20, no. , pp. 678-680, June 1971, doi:10.1109/T-C.1971.223325
560 ms
(Ver 3.3 (11022016))