Minimum adder depth multiple constant multiplication algorithm for low power FIR filters
Kenny Johansson, Oscar Gustafsson, Linda S. DeBrunner, Lars Wanhammar · 2011
In this work we propose a graph based minimum adder depth algorithm for the multiple constant multiplication (MCM) problem. Hence, all multiplier coefficients are here guaranteed to be realized at the theoretically lowest depth possible. The motivation for low adder depth is that this has been shown to be a main factor for the power consumption. An FIR filter is implemented using different MCM algorithms, and the proposed algorithm result in 25% lower power in the MCM part compared to algorithms focused on minimizing the number of adders.