Modified Booth algorithm for high radix multiplication
作者： P.E. Madrid , B. Millar , E.E. Swartzlander
关键词: Multiplication algorithm 、 Algorithm 、 Booth's multiplication algorithm 、 Product (mathematics) 、 Computer science 、 Radix 、 Multiplication
摘要: It is shown that, in general, the standard Booth algorithm cannot be extended to higher radix (>2) multiplication. A rule modify radix-2 for higher-radix multiplication presented. This corrects product computed by Booth's certain cases of high-radix bit-recoded multiplications. In addition, modification defined multipliers any size, utilizing power-of-2-bit recoding. >
sci-hub.se 参考文章(5)
ANDREW D. BOOTH, A SIGNED BINARY MULTIPLICATION TECHNIQUE Quarterly Journal of Mechanics and Applied Mathematics. ,vol. 4, pp. 236- 240 ,(1951) , 10.1093/QJMAM/4.2.236
O. Macsorley, High-Speed Arithmetic in Binary Computers Proceedings of the IRE. ,vol. 49, pp. 67- 91 ,(1961) , 10.1109/JRPROC.1961.287779
L.P. Rubinfield, A Proof of the Modified Booth's Algorithm for Multiplication IEEE Transactions on Computers. ,vol. 24, pp. 1014- 1015 ,(1975) , 10.1109/T-C.1975.224114
H. Sam, A. Gupta, A generalized multibit recoding of two's complement binary numbers and its proof with application in multiplier implementations IEEE Transactions on Computers. ,vol. 39, pp. 1006- 1015 ,(1990) , 10.1109/12.57039
S. Vassiliadis, E.M. Schwarz, D.J. Hanrahan, A general proof for overlapped multiple-bit scanning multiplications IEEE Transactions on Computers. ,vol. 38, pp. 172- 183 ,(1989) , 10.1109/12.16494