A Compact High-Speed Parallel Multiplication Scheme

This paper discusses a compact, fast, parallel multiplication scheme of the generation-reduction type using generalized Dadda-type pseudoadders for reduction and m X m multipliers for generation. The implications of present and future LSI are considered, a partitioning algorithm is presented, and the results obtained for a 24 X 24-bit implementation are discussed.

[1]  Paul A. Wintz,et al.  Fast Multipliers , 1970, IEEE Transactions on Computers.

[2]  S. D. Bedrosian,et al.  Iterative digital multiplier based on cellular arrays of r.o.m.s , 1975 .

[3]  Nick Kingsbury,et al.  High-speed binary multiplier , 1971 .

[4]  I. D. Deegan.  Cellular multiplier for signed binary numbers , 1971 .

[5]  Jayanti C. Majithia,et al.  An Iterative Array for Multiplication of Signed Binary Numbers , 1971, IEEE Transactions on Computers.

[6]  Christopher S. Wallace,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[7]  Stylianos D. Pezaris.  A 40-ns 17-Bit by 17-Bit Array Multiplier , 1971, IEEE Transactions on Computers.

[8]  Robert O. Winder,et al.  Majority Gate Networks , 1964, IEEE Trans. Electron. Comput..

[9]  Angelo Raffaele Meo.  Arithmetic Networks and Their Minimization Using a New Line of Elementary Units , 1975, IEEE Transactions on Computers.

[10]  Shanker Singh,et al.  Multiple Operand Addition and Multiplication , 1973, IEEE Trans. Computers.

[11]  T. C. Chen,et al.  Multiple Addition by Residue Threshold Functions and Their Representation by Array Logic , 1973, IEEE Transactions on Computers.

[12]  John A. Gibson,et al.  Synthesis and Comparison of Two's Complement Parallel Multipliers , 1975, IEEE Transactions on Computers.

[13]  Bruce A. Wooley,et al.  A Two's Complement Parallel Array Multiplication Algorithm , 1973, IEEE Transactions on Computers.

[14]  ANTONIN SVOBODA.  Adder With Distributed Control , 1970, IEEE Transactions on Computers.