Carry Propagation in Multiplication by Constants

Details Carry Propagation in Multiplication by Constants Carry Propagation in Multiplication by Constants

2008-01-25

arxiv.org/abs/0801.4040v1

Mathematics

Probability

Scientific paper

Suppose that a random n-bit number V is multiplied by an odd constant M, greater than or equal to 3, by adding shifted versions of the number V corresponding to the 1s in the binary representation of the constant M. Suppose further that the additions are performed by carry-save adders until the number of summands is reduced to two, at which time the final addition is performed by a carry-propagate adder. We show that in this situation the distribution of the length of the longest carry-propagation chain in the final addition is the same (up to terms tending to 0 as n tends to infinity) as when two independent n-bit numbers are added, and in particular the mean and variance are the same (again up to terms tending to 0). This result applies to all possible orders of performing the carry-save additions.

Affiliated with

Also associated with

No associations

Rating

Carry Propagation in Multiplication by Constants 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 Carry Propagation in Multiplication by Constants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Carry Propagation in Multiplication by Constants will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-111624