ACM Transactions on Algorithms (TALG): Volume 7 Issue 4, September 2011
Citation Count: 0
Downloads (6 Weeks): 0, Downloads (12 Months): 6, Downloads (Overall): 153
Full text available:
Suppose that a random n -bit number V is multiplied by an odd constant M ≥ 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 ...
Addition, multiplication, carry propagation