Abstract:This is a tutorial paper that examines the problem of performing fixed-point constant
integer multiplications using as few adders as possible. The driving application is the
design of digital filters, where it is often required that several products of a single
multiplicand are produced. Thus two specific problems are examined in detail, i.e.,
the one-input/one-output case and the one-input/several-output case. The latter is of
interest because it can take advantage of redundancy in the different coefficient m… Show more
“…This is not dealt with well by the existing techniques. We describe an algorithm, introduced in [14], briefly mentioned in [15], but which has not been widely available. We did not publish the algorithm earlier due to its slowness.…”
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.
“…This is not dealt with well by the existing techniques. We describe an algorithm, introduced in [14], briefly mentioned in [15], but which has not been widely available. We did not publish the algorithm earlier due to its slowness.…”
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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.