Issue No. 10 - October (1986 vol. 35)
T. Rhyne , MCC
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.
VLSI signal processing circuits, Bit-sequential multiplication, Booth's algorithm, carry-save arithmetic, computer arithmetic
T. Rhyne and N. I. Strader, "A Signed Bit-Sequential Multiplier," in IEEE Transactions on Computers, vol. 35, no. , pp. 896-901, 1986.