摘要 |
Coefficients each corresponding to the radical numbers of 2 are generated by a coefficient generator based on the secondary Booth algorithm. Based on the coefficients, partial products of a multiplicand are calculated by a partial product generator and converted into positive numbers by adders. A corrective bit of "1" is added by an adder to the least significant bit of those bits to which "1" has been added by the conversion of partial products into positive numbers, and the sum of partial products corresponding to the radical numbers of 2, i.e., a multiplication result, is determined by adders.
|