Operand Folding Hardware Multipliers

Details Operand Folding Hardware Multipliers Operand Folding Hardware Multipliers

2011-04-08

arxiv.org/abs/1104.1533v1

Computer Science

Mathematical Software

Scientific paper

This paper describes a new accumulate-and-add multiplication algorithm. The method partitions one of the operands and re-combines the results of computations done with each of the partitions. The resulting design turns-out to be both compact and fast. When the operands' bit-length $m$ is 1024, the new algorithm requires only $0.194m+56$ additions (on average), this is about half the number of additions required by the classical accumulate-and-add multiplication algorithm ($\frac{m}2$).

Affiliated with

Also associated with

No associations

Rating

Operand Folding Hardware Multipliers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Operand Folding Hardware Multipliers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Operand Folding Hardware Multipliers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-354557