This Article 
 Bibliographic References 
 Add to: 
High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree
September 1985 (vol. 34 no. 9)
pp. 789-796
N. Takagi, Department of Information Science, Faculty of Engineering, Kyoto University
A high-speed VLSI multiplication algorithm internally using redundant binary representation is proposed. In n bit binary integer multiplication, n partial products are first generated and then added up pairwise by means of a binary tree of redundant binary adders. Since parallel addition of two n-digit redundant binary numbers can be performed in a constant time independent of n without carry propagation, n bit multiplication can be performed in a time proportional to log2 n. The computation time is almost the same as that by a multiplier with a Wallace tree, in which three partial products will be converted into two, in contrast to our two-to-one conversion, and is much shorter than that by an array multiplier for longer operands. The number of computation elements of an n bit multiplier based on the algorithm is proportional to n2. It is almost the same as those of conventional ones. Furthermore, since the multiplier has a regular cellular array structure similar to an array multiplier, it is suitable for VLSI implementation. Thus, the multiplier is excellent in both computation speed and regularity in layout. It can be implemented on a VLSI chip with an area proportional to n2 log2 n. The algorithm can be directly applied to both unsigned and 2's complement binary integer multiplication.
Index Terms:
VLSI, Arithmetic operations, binary integer multiplication, carry-propagation-free adder, hardware algorithm, high-speed multiplier, redundant binary representation, signed-digit number representation
N. Takagi, H. Yasuura, S. Yajima, "High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree," IEEE Transactions on Computers, vol. 34, no. 9, pp. 789-796, Sept. 1985, doi:10.1109/TC.1985.1676634
Usage of this product signifies your acceptance of the Terms of Use.