The design of fast multipliers for binary numbers represented in serial form is considered according to a general scheme composed by an array generator and a summator. The bits of the product are generated with the least delay with respect to the operators bits. The array generator computes the elements of the multiplier array. The summator computes the sum of the array elements in order to generate the product bits. The array elements can be generated according to two different general schemes: the first computes all the new array elements at each step (arranged on a diagonal and on a row of the multiplier array), the second computes the multiplier array elements column by column, Several schemes of array generators are given and compared, and for each of them a suitable summator using parallel counters is illustrated.
[1]
Luigi Dadda.
Multiple addition of binary serial numbers
,
1978,
1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).
[2]
Kishor S. Trivedi,et al.
On-line algorithms for division and multiplication
,
1975,
1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH).
[3]
William J. Kubitz,et al.
A Compact High-Speed Parallel Multiplication Scheme
,
1977,
IEEE Transactions on Computers.
[4]
Luigi Dadda.
Composite Parallel Counters
,
1980,
IEEE Transactions on Computers.
[5]
Paul A. Wintz,et al.
Fast Multipliers
,
1970,
IEEE Transactions on Computers.
[6]
Earl E. Swartzlander.
Parallel Counters
,
1973,
IEEE Transactions on Computers.