General algorithms for reduced-adder integermultiplier design

Andrew Graham Dempster, M.D. Macleod · Electronics Letters · 1995

The problem of reducing the number of adders required to perform shift-and-add multiplication is addressed for hardware and software applications. Algorithms invented for each of these applications are compared and found to have similar performances in general. Improved results are achieved by selecting the best design of the two.

Read the paper · More papers on PaperTik