A Proof of the Modified Booth's Algorithm for Multiplication

IEEE Transactions on Computers

Volumn C-24, Issue 10, 1975, Pages 1014-1015

  Rubinfield, Louis P ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

Modified Booth'; s algorithm multiplicand multi plier partial product

Indexed keywords

EID: 84944981017     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1975.224114     Document Type: Article

References (3)

1. A. D. Booth, “A signed binary multiplication technique,” Quart. J. Mech. Appl. Math., vol. 4, part 2, 1951.
2. O. L. MacSorley, “High-speed arithmetic in binary computers,” Proc. IRE, vol. 49, pp. 67-91, Jan. 1961.
3. S. Anderson, J. Earle, R. Goldschmidt, and D. Powers, “The IBM system 360 model 91: Floating-point execution unit,” IBM J. Res. Develop., vol. II, no. 1, Jan. 1967.