CONSTANT INTEGER MULTIPLICATION USING MINIMUM ADDERS

A new method of formulating constant integer multiplication is present ed. It requires fewer adders in general than a canonic signed-digit (C SD) representation; Graphs are used to illustrate multiplier implement ation. A general suboptimal algorithm for the design of multipliers of any wordlength is presented. For 32-bit welds, it achieves an average improvement of 26.6% over CSD. Rules for the generation of graphs wit h the minimum number of adders and subtractors are presented. An exhau stive search algorithm using these rules is described, and applied for wordlengths up to 12 bits. For 12-bit words, it was found that an ave rage improvement of 16% over CSD is achievable.