
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
A Two's Complement Parallel Array Multiplication Algorithm
December 1973 (vol. 22 no. 12)
pp. 10451047
ASCII Text  x  
C.R. Baugh, B.A. Wooley, "A Two's Complement Parallel Array Multiplication Algorithm," IEEE Transactions on Computers, vol. 22, no. 12, pp. 10451047, December, 1973.  
BibTex  x  
@article{ 10.1109/TC.1973.223648, author = {C.R. Baugh and B.A. Wooley}, title = {A Two's Complement Parallel Array Multiplication Algorithm}, journal ={IEEE Transactions on Computers}, volume = {22}, number = {12}, issn = {00189340}, year = {1973}, pages = {10451047}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1973.223648}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Two's Complement Parallel Array Multiplication Algorithm IS  12 SN  00189340 SP1045 EP1047 EPD  10451047 A1  C.R. Baugh, A1  B.A. Wooley, PY  1973 KW  Array multiplier KW  binary multiplication KW  highperformance multiplication KW  parallel multiplier KW  two's complement multiplication. VL  22 JA  IEEE Transactions on Computers ER   
An algorithm for highspeed, two's complement, mbit by nbit parallel array multiplication is described. The two's complement multiplication is converted to an equivalent parallel array addition problem in which each partial product bit is the AND of a multiplier bit and a multiplicand bit, and the signs of all the partial product bits are positive.
Index Terms:
Array multiplier, binary multiplication, highperformance multiplication, parallel multiplier, two's complement multiplication.
Citation:
C.R. Baugh, B.A. Wooley, "A Two's Complement Parallel Array Multiplication Algorithm," IEEE Transactions on Computers, vol. 22, no. 12, pp. 10451047, Dec. 1973, doi:10.1109/TC.1973.223648
Usage of this product signifies your acceptance of the Terms of Use.