A Suggestion for a Fast Multiplier

  title={A Suggestion for a Fast Multiplier},
  author={D. H. Jacobsohn},
  journal={IEEE Trans. Electron. Comput.},
will be less than Cnt+1(t+1)! but may be space into which the latter may be divided multiplier into twenty 2-bit segments. He (and usually will be) more than (t+2)!. by a maximum possible number of mutual then develops an adder tree to sum this set When t= 1 the maximum number of regions intersections of n t-flats. In general, q will be of twenty entries. He then shows that a tree will be dependent on both t and n. It is first shown of nineteen adders (I believe twenty are 

Topics from this paper

A low power-delay-product multiplier with dynamic operand exchange
Reviewing 4-to-2 adders for multi-operand addition
  • Peter Kornerup
  • Computer Science
  • Proceedings IEEE International Conference on Application- Specific Systems, Architectures, and Processors
  • 2002
A method for calculation of the square root using combinatorial logic
  • D. Mandelbaum
  • Mathematics, Computer Science
  • J. VLSI Signal Process.
  • 1993
A Two's Complement Array Multiplier Using True Values of the Operands
The Quasi-Serial Multiplier
Interlaced Partition Multiplier
A Slimplified Architecture for Modulo (2n + 1) Multiplication
  • Yutai Ma
  • Computer Science
  • IEEE Trans. Computers
  • 1998
Fast multiply-accumulate architecture
Faster Modulo 2 n + 1 Multipliers without Booth Recoding


A Suggestion for a Fast Multiplier
  • C. Wallace
  • Computer Science
  • IEEE Trans. Electron. Comput.
  • 1964