Design of multiplierless FIR filters with an adder depth versus filter order trade-off

In this work, the trade-offs in FIR filter design are studied. This includes the adder depth for the constant filter coefficients, the number of adders, and the number of delay elements, i.e., the filter order. It is shown that the proposed design algorithm can be used to decrease both the overall arithmetic complexity and the adder depth, possibly with a small penalty in delay elements. This is achieved by selecting coefficients that can be realized at a lower depth, i.e., the lengths of the logic paths are reduced. Hence, this directly translates into decreased power consumption due to reduced glitch propagation and increased throughput due to a shorter critical path.

[1]  Andrew G. Dempster,et al.  Designing multiplier blocks with low logic depth , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[2]  O. Gustafsson,et al.  A detailed complexity model for multiple constant multiplication and an algorithm to minimize the complexity , 2005, Proceedings of the 2005 European Conference on Circuit Theory and Design, 2005..

[3]  Lars Wanhammar.  DSP integrated circuits , 1999 .

[4]  Andrew G. Dempster,et al.  Generation of signed-digit representations for integer multiplication , 2004, IEEE Signal Processing Letters.

[5]  Oscar Gustafsson,et al.  Lower Bounds for Constant Multiplication Problems , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.

[6]  Xiaojuan Hu,et al.  An efficient design for FIR filters with variable precision , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[7]  Patrick Schaumont,et al.  A new algorithm for elimination of common subexpressions , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  David Bull,et al.  Primitive operator digital filters , 1991 .

[9]  Lars Wanhammar,et al.  Bit-Level Optimization of Shift-and-Add Based FIR Filters , 2007, 2007 14th IEEE International Conference on Electronics, Circuits and Systems.

[10]  Andrew G. Dempster,et al.  Transition analysis on FPGA for multiplier-block based FIR filter structures , 2000, ICECS 2000. 7th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.00EX445).

[11]  R. Hartley.  Subexpression sharing in filters using canonic signed digit multipliers , 1996 .

[12]  A. Dempster,et al.  Use of minimum-adder multiplier blocks in FIR digital filters , 1995 .

[13]  Oscar Gustafsson,et al.  A Difference Based Adder Graph Heuristic for Multiple Constant Multiplication Problems , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[14]  Miodrag Potkonjak,et al.  Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Lars Wanhammar,et al.  Minimum adder depth multiple constant multiplication algorithm for low power FIR filters , 2011, 2011 IEEE International Symposium of Circuits and Systems (ISCAS).

[16]  Markus Püschel,et al.  Multiplierless multiple constant multiplication , 2007, TALG.