The Community for Technology Leaders
Green Image
Issue No. 09 - September (1985 vol. 34)
ISSN: 0018-9340
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.
VLSI, Arithmetic operations, binary integer multiplication, carry-propagation-free adder, hardware algorithm, high-speed multiplier, redundant binary representation, signed-digit number representation

N. Takagi, S. Yajima and H. Yasuura, "High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree," in IEEE Transactions on Computers, vol. 34, no. , pp. 789-796, 1985.
84 ms
(Ver 3.3 (11022016))