This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Signed Bit-Sequential Multiplier
October 1986 (vol. 35 no. 10)
pp. 896-901
Bit-sequential algorithms for arithmetic processing are good candidates for VLSI signal processing circuits because of their canonical structure and minimal interconnection requirements. Several recent papers have dealt with algorithms that accept unsigned binary inputs, one bit at a time, least significant bit first, and produce an unsigned binary product in a bit-serial fashion.
Index Terms:
VLSI signal processing circuits, Bit-sequential multiplication, Booth's algorithm, carry-save arithmetic, computer arithmetic
Citation:
T. Rhyne, N.R., II Strader, "A Signed Bit-Sequential Multiplier," IEEE Transactions on Computers, vol. 35, no. 10, pp. 896-901, Oct. 1986, doi:10.1109/TC.1986.1676680
Usage of this product signifies your acceptance of the Terms of Use.