|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
A Proof of the Modified Booth's Algorithm for Multiplication
October 1975 (vol. 24 no. 10)
pp. 1014-1015
| ASCII Text | x | ||
| L.P. Rubinfield, "A Proof of the Modified Booth's Algorithm for Multiplication," IEEE Transactions on Computers, vol. 24, no. 10, pp. 1014-1015, October, 1975. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1975.224114, author = {L.P. Rubinfield}, title = {A Proof of the Modified Booth's Algorithm for Multiplication}, journal ={IEEE Transactions on Computers}, volume = {24}, number = {10}, issn = {0018-9340}, year = {1975}, pages = {1014-1015}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1975.224114}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - A Proof of the Modified Booth's Algorithm for Multiplication IS - 10 SN - 0018-9340 SP1014 EP1015 EPD - 1014-1015 A1 - L.P. Rubinfield, PY - 1975 KW - Modified Booth's algorithm KW - multiplicand KW - multiplier KW - partial product. VL - 24 JA - IEEE Transactions on Computers ER - | |||
A simplified proof of a modification of Booth's multiplication algorithm by MacSorley to a form which examines three multiplier bits at a time is presented. In comparison with the original Booth's algorithm, which examines two bits at a time, the modified algorithm requires half the nutmber of iterations at the cost of somewhat increased complexity for each iteration.
Index Terms:
Modified Booth's algorithm, multiplicand, multiplier, partial product.
Citation:
L.P. Rubinfield, "A Proof of the Modified Booth's Algorithm for Multiplication," IEEE Transactions on Computers, vol. 24, no. 10, pp. 1014-1015, Oct. 1975, doi:10.1109/T-C.1975.224114
Usage of this product signifies your acceptance of the Terms of Use.