Multiplication by two integers using the minimum number of adders
Andrew Graham Dempster, M.D. Macleod · 2005
The two-coefficient minimum-adder graph (MAG2) algorithm is described and shown to be optimal. A partial implementation, optimal for pairs of integers up to 8 bits, outperforms the best existing algorithms.