Minimum adder depth multiple constant multiplication algorithm for low power FIR filters

Citations Over TimeTop 10% of 2011 papers

Abstract

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.

Related Papers

• → Review on FIR Filters Using Different Adders and Multipliers Based on Vedic Mathematics(2021)4 cited
• → An improved constant coefficient multiplication algorithm based on cascaded adder graph(2013)2 cited
• → Binary Multiplication with Overlapped Addition Cycles(1969)1 cited
• Reconfigurable Design and Implementation of Modulo Multiplication(2008)
• → Modified Binary Vedic Multiplication Using Carry Save Adder(2021)